Skip to main content
SpringerLink
Log in

An efficient parallel algorithm for maximal matching

  • Posters
  • Conference paper
  • First Online:
Book cover Parallel Processing: CONPAR 92—VAPP V (VAPP 1992, CONPAR 1992)

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

Abstract

We present a parallel algorithm for maximal matching of an undirected graph. The algorithm runs in O(log 3n) time and uses O(m+n) processors on a EREW-PRAM, where m and n are the number of edges and vertices in the graph, respectively.

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

References

  1. Karp, R.M. and Wigderson, W., A fast parallel algorithm for Maximal Independent Set problem, Proc. 16-th Ann. ACM Symp. on Theory of Computing, 1984, pp.266–272.

    Google Scholar 

  2. Israeli, A. and Shiloach, Y., An improved parallel algorithm for maximal matching, Information Processing Letter, 22(1986), pp.57–60.

    Google Scholar 

  3. Awerbuch, B.and Shiloach, Y., New connectivity and MSF algorithms for suffle-cxchangc network and PRAM, IEEE Tran. on Computers, Vol. C-36, No. 10, Oct. 1987, pp. 1258–1263.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology, 721302, Kharagpur, India

    Alak K. Datta

  2. Department of Computer Science and Engineering, Indian Institute of Technology, 721302, Kharagpur, India

    Ranjan K. Sen

Authors
  1. Alak K. Datta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ranjan K. Sen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luc Bougé Michel Cosnard Yves Robert Denis Trystram

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Datta, A.K., Sen, R.K. (1992). An efficient parallel algorithm for maximal matching. In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_502

Download citation

  • DOI: https://doi.org/10.1007/3-540-55895-0_502

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55895-8

  • Online ISBN: 978-3-540-47306-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation