Skip to main content
SpringerLink
Log in

A simple randomized parallel algorithm for maximal f-matchings

  • Conference paper
  • First Online:
LATIN '92 (LATIN 1992)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 583))

Included in the following conference series:

  • 139 Accesses

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

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Google Scholar 

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

    Google Scholar 

  3. A. Gibbons and W. Rytter, Efficient Parallel Algorithms. Cambridge University Press, Cambridge, 1988.

    Google Scholar 

  4. T. Hagerup and C. Rüb, A guided tour of Chernoff bounds. Information Proccessing Letters 33 (1989/90) 305–308.

    Google Scholar 

  5. A. Israeli and A. Itai, A fast and simple randomized parallel algorithm for maximal matching. Information Proccessing Letters 22 (1986) 77–80.

    Google Scholar 

  6. A. Israeli and Y. Shiloach, An improved parallel algorithm for maximal matching. Information Proccessing Letters 22 (1986) 57–60.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund University, Box 118, S-221 00, Lund, Sweden

    Oscar Garrido & Andrzej Lingas

  2. Institute of Informatics, Warsaw University, PKiN VIII p., 00-901, Warsaw, Poland

    Stefan Jarominek & Wojciech Rytter

Authors
  1. Oscar Garrido
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Jarominek
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Lingas
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Wojciech Rytter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Imre Simon

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation