An efficient parallel algorithm for maximal matching

  • Alak K. Datta
  • Ranjan K. Sen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 634)


We present a parallel algorithm for maximal matching of an undirected graph. The algorithm runs in O(log3n) 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.


  1. 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. 2.
    Israeli, A. and Shiloach, Y., An improved parallel algorithm for maximal matching, Information Processing Letter, 22(1986), pp.57–60.Google Scholar
  3. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Alak K. Datta
    • 1
  • Ranjan K. Sen
    • 2
  1. 1.Department of MathematicsIndian Institute of TechnologyKharagpurIndia
  2. 2.Department of Computer Science and EngineeringIndian Institute of TechnologyKharagpurIndia

Personalised recommendations