Abstract
We show how to extend the RNC-algorithm for maximal matchings due to Israeli-Itai (presented in [5]) to compute maximal (with respect to set of edges inclusion) f-matchings. Our algorithm works in \(\mathcal{O}\)(log2 n) time on an arbitrary Crcw Pram with a linear number of processors. Also we slightly improve a constant coefficient in the analysis of the Israeli-Itai algorithm. Finally we present more efficient NC algorithms for maximal f-matchings for several non-trivial graph classes and a faster RNC algorithm for approximate-maximal f-matching in general graphs.
This article was processed using the LATEX macro package with LMAMULT style
Preview
Unable to display preview. Download preview PDF.
References
S. Cook, The Classification of Problems which have Fast Parallel Algorithms Proceedings of the 1983 International FCT-Conference, Borgholm, Sweden, Lecture Notes in Computer Science (1983) 78–93.
K. Diks, O. Garrido and A. Lingas, Parallel algorithms for finding maximal k-dependent sets and maximal f-matchings. To appear in the Proceedings of the Second Annual International Symposium on Algorithms ISA 91, Taipei, Taiwan (1991).
A. Gibbons and W. Rytter, Efficient Parallel Algorithms. Cambridge University Press, Cambridge, 1988.
T. Hagerup and C. Rüb, A guided tour of Chernoff bounds. Information Proccessing Letters 33 (1989/90) 305–308.
A. Israeli and A. Itai, A fast and simple randomized parallel algorithm for maximal matching. Information Proccessing Letters 22 (1986) 77–80.
A. Israeli and Y. Shiloach, An improved parallel algorithm for maximal matching. Information Proccessing Letters 22 (1986) 57–60.
C. Levcopoulos, A. Lingas, O. Peterson and W. Rytter, Optimal parallel algorithms for testing isomorphism of trees and outerplanar graphs. Proceedings to 10th FST-TCS, Bengalore, India, Lecture Notes in Computer Science (1990) 204–214.
L. Lovsz and M. D. Plummer, Matching Theory, Annals of Discrete Mathematics (29). North-Holland Mathematics Studies 121. Elsevier Science Publishers B.V. ISBN 0444879161.
C. N. K. Osiakwan and S. G. Akl, Optimal parallel algorithms for b-mathings in trees. Proceedings to Optimal Algorithms International Symposium Lecture notes in Computer Science 401 (1989) 274–308.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garrido, O., Jarominek, S., Lingas, A., Rytter, W. (1992). A simple randomized parallel algorithm for maximal f-matchings. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023827
Download citation
DOI: https://doi.org/10.1007/BFb0023827
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55284-0
Online ISBN: 978-3-540-47012-0
eBook Packages: Springer Book Archive