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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information processing letters Jg. 57; H. 2; S. 83 - 87
Hauptverfasser:	Garrido, Oscar, Jarominek, Stefan, Lingas, Andrzej, Rytter, Wojciech
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 29.01.1996 Elsevier Science Elsevier Sequoia S.A
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!