A simple randomized parallel algorithm for maximal ƒ-matchings

For many problems the main advantage of randomization is gaining simplicity. This happens in the computation of maximal matchings in graphs. It is shown that a known and quite simple randomized algorithm for maximal matchings has a natural extension to the so called f-matchings (which are generaliza...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information processing letters Ročník 57; číslo 2; s. 83 - 87
Hlavní autori: Garrido, Oscar, Jarominek, Stefan, Lingas, Andrzej, Rytter, Wojciech
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Amsterdam Elsevier B.V 29.01.1996
Elsevier Science
Elsevier Sequoia S.A
Predmet:
Algorithms
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
f-matchings
Graphs
Information processing
Information retrieval. Graph
Parallel algorithms
Parallel processing
Studies
Theoretical computing
f-matchings
Parallel algorithms
Randomization
Maximal matching
Graph theory
Generalization
Graph matching
Non directed graph
ISSN:0020-0190, 1872-6119
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract For many problems the main advantage of randomization is gaining simplicity. This happens in the computation of maximal matchings in graphs. It is shown that a known and quite simple randomized algorithm for maximal matchings has a natural extension to the so called f-matchings (which are generalizations of matchings). In particular, each (usual) matching is a 1-matching. The whole structure of the randomized algorithm is very simple; it finds a partial f-matching F, deletes the edges of F, updates capacities and then removes edges incident to vertices with actual capacity equal to zero. This continues until the graph is empty.
AbstractList For many problems the main advantage of randomization is gaining simplicity. This happens in the computation of maximal matchings in graphs. It is shown that a known and quite simple randomized algorithm for maximal matchings has a natural extension to the so called f-matchings (which are generalizations of matchings). In particular, each (usual) matching is a 1-matching. The whole structure of the randomized algorithm is very simple; it finds a partial f-matching F, deletes the edges of F, updates capacities and then removes edges incident to vertices with actual capacity equal to zero. This continues until the graph is empty.
Author Lingas, Andrzej
Jarominek, Stefan
Rytter, Wojciech
Garrido, Oscar
Author_xml – sequence: 1
  givenname: Oscar
  surname: Garrido
  fullname: Garrido, Oscar
  organization: Department of Computer Science, Lund University Box 118, S-221 00 Lund,Sweden
– sequence: 2
  givenname: Stefan
  surname: Jarominek
  fullname: Jarominek, Stefan
  organization: Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland
– sequence: 3
  givenname: Andrzej
  surname: Lingas
  fullname: Lingas, Andrzej
  organization: Department of Computer Science, Lund University Box 118, S-221 00 Lund,Sweden
– sequence: 4
  givenname: Wojciech
  surname: Rytter
  fullname: Rytter, Wojciech
  organization: Institute of Informatics, Warsaw University, Banacha 2, 02-097 Warsaw, Poland
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2989777$$DView record in Pascal Francis
BookMark eNp9kMtOwzAQRS1UJNrCH7CIEAtYBMbOw_EGVFW8pEpsYG05frSukjjYKQI-g4_iu0ho1SWr2Zx7Z-ZM0KhxjUboFMMVBpxfAxCIATO4YNklAKYsTg_QGBeUxDnGbITGe-QITUJYA0CeJnSMbmdRsHVb6ciLRrnafmkVtcKLqtJVJKql87Zb1ZFxPqrFh61FFf18x7Xo5Mo2y3CMDo2ogj7ZzSl6vb97mT_Gi-eHp_lsEcsE4y42FJKCKSgNkbIwQuaZyrMylaLA2rCMplSZkimVEAOiBGwUJYqWKZiC0IQmU3S27W29e9vo0PG12_imX8lJQgllOCl66HwHiSBFZfqXpA289f3Z_pMTVjBKh650i0nvQvDa7AkMfBDKB1t8sMVZxv-E8rSP3Wxjuv_z3WrPg7S6kVpZr2XHlbP_F_wCUkV-SQ
CODEN IFPLAT
Cites_doi 10.1016/0020-0190(86)90144-4
10.1142/S0129054193000122
10.1137/0217049
10.1016/0020-0190(86)90141-9
10.1016/0020-0190(90)90214-I
10.1016/0020-0190(94)90130-9
ContentType Journal Article
Copyright 1996
1996 INIST-CNRS
Copyright Elsevier Sequoia S.A. Jan 29, 1996
Copyright_xml – notice: 1996
– notice: 1996 INIST-CNRS
– notice: Copyright Elsevier Sequoia S.A. Jan 29, 1996
DBID AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/0020-0190(95)00179-4
DatabaseName CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
Applied Sciences
EISSN 1872-6119
EndPage 87
ExternalDocumentID 9296256
2989777
10_1016_0020_0190_95_00179_4
0020019095001794
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29I
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABBOA
ABEFU
ABFNM
ABFSI
ABJNI
ABMAC
ABTAH
ABXDB
ABYKQ
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADJOM
ADMUD
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
E.L
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HLZ
HMJ
HVGLF
HZ~
IHE
J1W
KOM
LG9
M26
M41
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
SBC
SDF
SDG
SDP
SES
SEW
SME
SPC
SPCBC
SSV
SSZ
T5K
TN5
UQL
WH7
WUQ
XPP
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c311t-f70389d0bf2cc8fac65d65b4ca81ef95747dfb9dd32f0ab01fd72d7b40f827373
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=0020019095001794&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0020-0190
IngestDate Sun Nov 09 08:27:44 EST 2025
Mon Jul 21 09:15:39 EDT 2025
Sat Nov 29 02:29:43 EST 2025
Fri Feb 23 02:33:11 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords f-matchings
Parallel algorithms
Randomization
Maximal matching
Graph theory
Generalization
Graph matching
Non directed graph
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c311t-f70389d0bf2cc8fac65d65b4ca81ef95747dfb9dd32f0ab01fd72d7b40f827373
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
PQID 237279138
PQPubID 45522
PageCount 5
ParticipantIDs proquest_journals_237279138
pascalfrancis_primary_2989777
crossref_primary_10_1016_0020_0190_95_00179_4
elsevier_sciencedirect_doi_10_1016_0020_0190_95_00179_4
PublicationCentury 1900
PublicationDate 1996-01-29
PublicationDateYYYYMMDD 1996-01-29
PublicationDate_xml – month: 01
  year: 1996
  text: 1996-01-29
  day: 29
PublicationDecade 1990
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Information processing letters
PublicationYear 1996
Publisher Elsevier B.V
Elsevier Science
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier Science
– name: Elsevier Sequoia S.A
References Hagerup, Rüb (BIB4) 1989/1990; 33
Mayr, Subramian (BIB9) 1989
K. Diks, O. Garrido and A. Lingas, Parallel algorithms for finding maximal
Kelsen (BIB8) 1994; 52
Cole (BIB1) 1988; 17
pp. 179–192.
Gibbons, Rytter (BIB3) 1988
Israeli, Itai (BIB5) 1986; 22
dependent sets and maximal ƒ-matchings
Israeli, Shiloach (BIB6) 1986; 22
Karp, Ramachandran (BIB7) 1990; Vol. A
Mayr (10.1016/0020-0190(95)00179-4_BIB9) 1989
Cole (10.1016/0020-0190(95)00179-4_BIB1) 1988; 17
10.1016/0020-0190(95)00179-4_BIB2
Israeli (10.1016/0020-0190(95)00179-4_BIB5) 1986; 22
Karp (10.1016/0020-0190(95)00179-4_BIB7) 1990; Vol. A
Kelsen (10.1016/0020-0190(95)00179-4_BIB8) 1994; 52
Israeli (10.1016/0020-0190(95)00179-4_BIB6) 1986; 22
Hagerup (10.1016/0020-0190(95)00179-4_BIB4) 1989; 33
Gibbons (10.1016/0020-0190(95)00179-4_BIB3) 1988
References_xml – reference: K. Diks, O. Garrido and A. Lingas, Parallel algorithms for finding maximal
– volume: Vol. A
  start-page: 869
  year: 1990
  end-page: 941
  ident: BIB7
  article-title: Parallel algorithms for shared memory machines
  publication-title: Handbook of Theoretical Computer Science
– start-page: 114
  year: 1989
  end-page: 123
  ident: BIB9
  article-title: The complexity of circuit value and network stability
  publication-title: Proc. 4th. Ann. IEEE Conf.on Structure in Complexity Theory
– volume: 22
  start-page: 77
  year: 1986
  end-page: 80
  ident: BIB5
  article-title: A fast and simple randomized parallel algorithm for maximal matching
  publication-title: Inform. Process. Lett.
– reference: -dependent sets and maximal ƒ-matchings,
– volume: 22
  start-page: 57
  year: 1986
  end-page: 60
  ident: BIB6
  article-title: An improved parallel algorithm for maximal matching
  publication-title: Inform. Process. Lett.
– reference: , pp. 179–192.
– volume: 52
  start-page: 223
  year: 1994
  end-page: 228
  ident: BIB8
  article-title: An optimal parallel algorithm for maximal matching
  publication-title: Inform. Process. Lett.
– volume: 17
  start-page: 770
  year: 1988
  end-page: 785
  ident: BIB1
  article-title: Parallel merge sort
  publication-title: SIAM J. Comput.
– year: 1988
  ident: BIB3
  article-title: Efficient Parallel Algorithms
– volume: 33
  start-page: 305
  year: 1989/1990
  end-page: 308
  ident: BIB4
  article-title: A guided tour of Chernoff bounds
  publication-title: Inform. Process. Lett.
– volume: 22
  start-page: 77
  year: 1986
  ident: 10.1016/0020-0190(95)00179-4_BIB5
  article-title: A fast and simple randomized parallel algorithm for maximal matching
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(86)90144-4
– ident: 10.1016/0020-0190(95)00179-4_BIB2
  doi: 10.1142/S0129054193000122
– volume: 17
  start-page: 770
  year: 1988
  ident: 10.1016/0020-0190(95)00179-4_BIB1
  article-title: Parallel merge sort
  publication-title: SIAM J. Comput.
  doi: 10.1137/0217049
– volume: 22
  start-page: 57
  year: 1986
  ident: 10.1016/0020-0190(95)00179-4_BIB6
  article-title: An improved parallel algorithm for maximal matching
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(86)90141-9
– volume: 33
  start-page: 305
  year: 1989
  ident: 10.1016/0020-0190(95)00179-4_BIB4
  article-title: A guided tour of Chernoff bounds
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(90)90214-I
– year: 1988
  ident: 10.1016/0020-0190(95)00179-4_BIB3
– volume: 52
  start-page: 223
  year: 1994
  ident: 10.1016/0020-0190(95)00179-4_BIB8
  article-title: An optimal parallel algorithm for maximal matching
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(94)90130-9
– volume: Vol. A
  start-page: 869
  year: 1990
  ident: 10.1016/0020-0190(95)00179-4_BIB7
  article-title: Parallel algorithms for shared memory machines
– start-page: 114
  year: 1989
  ident: 10.1016/0020-0190(95)00179-4_BIB9
  article-title: The complexity of circuit value and network stability
SSID ssj0006437
Score 1.442009
Snippet For many problems the main advantage of randomization is gaining simplicity. This happens in the computation of maximal matchings in graphs. It is shown that a...
SourceID proquest
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Publisher
StartPage 83
SubjectTerms Algorithms
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
f-matchings
Graphs
Information processing
Information retrieval. Graph
Parallel algorithms
Parallel processing
Studies
Theoretical computing
Title A simple randomized parallel algorithm for maximal ƒ-matchings
URI https://dx.doi.org/10.1016/0020-0190(95)00179-4
https://www.proquest.com/docview/237279138
Volume 57
WOSCitedRecordID wos0020019095001794&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1872-6119
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0006437
  issn: 0020-0190
  databaseCode: AIEXJ
  dateStart: 19950113
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Jb9NAFB6FlAMSYkeEUuQDkUCVRTxexnNCUVWWChUORfRmzVpcEieyQxX6F7jxo_hdvPHMOAkVSw9crGisPI_mffPm8_NbEHqS8hQTMoL9LZgIk0TikImIhzxNeKYUzSLZavotOTzMj4_p-17vm8-FOZuQqsqXSzr_r6qGMVC2SZ29hLo7oTAAv0HpcAW1w_WfFD_ebUpT8ncXTiE5m5bnQClNge_JRJlo5JNZXS4-TdvwwilbllPQ0XAvG1IcAnltIyubdcbq8pVamMxtVoHxLkzaNKCOkL9idV3K1u36rhGsi_g9YDVMoVKfXUSZXgsBMs24Gx9Uea5Ou28_XxeuW8jH2SmYHudrky5Xr3VNOP-FTxUwUW-2H6g3t7YetYMVXrOdtqHNxil8wb5bV0MnF0g4TYeYmrOWumyhjZLavxx1XQCij20zkgojqaBp0UopkitoC5OU5n20NX6zf3zQHezmG6eNGLJP95mYUfa8G3tK02duNr9jOtfnDBQx0bZxygUO0BKbo1vohnsjCcYWSbdRT1V30E3f7SNwxv8uejEOLLCCFbACD6ygA1YAcAkcsIIf31eguoc-vNw_2nsduvYboYijaBFqYoovyhHXWIhcM5GlMkt5IlgeKU1TeBGVmlMpY6xHjI8iLQmWhCcjnQMpJvF91K9mlXqAAoqVFEmG4YYESqh5DDKViCIWc8ANHqDQL1Uxt1VWij-paICIX8_CMUXLAAsAyl_-ubOx_N3jTCcCQsgAbXt1FG5TNwWOgeXTKM4fXnKe2-jaal88Qv1F_UXtoKvibFE29WOHr59ff5q_
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+simple+randomized+parallel+algorithm+for+maximal+%C6%92-matchings&rft.jtitle=Information+processing+letters&rft.au=Garrido%2C+Oscar&rft.au=Jarominek%2C+Stefan&rft.au=Lingas%2C+Andrzej&rft.au=Rytter%2C+Wojciech&rft.date=1996-01-29&rft.issn=0020-0190&rft.volume=57&rft.issue=2&rft.spage=83&rft.epage=87&rft_id=info:doi/10.1016%2F0020-0190%2895%2900179-4&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_0020_0190_95_00179_4
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon