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ženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 57; číslo 2; s. 83 - 87
Hlavní autoři: Garrido, Oscar, Jarominek, Stefan, Lingas, Andrzej, Rytter, Wojciech
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 29.01.1996
Elsevier Science
Elsevier Sequoia S.A
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/0020-0190(95)00179-4