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

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 57; no. 2; pp. 83 - 87
Main Authors:	Garrido, Oscar, Jarominek, Stefan, Lingas, Andrzej, Rytter, Wojciech
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 29.01.1996 Elsevier Science Elsevier Sequoia S.A
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!