Skip to main content
SpringerLink
Log in

An efficient distributed algorithm for maximum matching in general graphs

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We present a distributed algorithm for maximum cardinality matching in general graphs. On a general graph withn vertices, our algorithm requiresO(n 5/2) messages in the worst case. On trees, our algorithm computes a maximum matching usingO(n) messages after the election of a leader.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Awerbuch, B. (1985a), Complexity of Network Synchronization,J Assoc. Comput. Mach.,32, 804–823.

    MATH  MathSciNet  Google Scholar 

  • Awerbuch, B. (1985b), A New Distributed Depth-First-Search Algorithm,Inform. Process. Lett.,20, 147–150.

    Article  MATH  Google Scholar 

  • Berge, C. (1957), Two Theorems in Graph Theory,Proc. Nat. Acad. Sci. U.S.A.,43, 842–844.

    Article  MATH  MathSciNet  Google Scholar 

  • Edmonds, J. (1965), Paths, Trees, and Flowers,Canad. J. Math.,17, 449–467.

    MATH  MathSciNet  Google Scholar 

  • Even, S., and Kariv, O. (1975), AnO(n 2,5) Algorithm for Maximum Matching in General Graphs,Proc. 16th Annual IEEE Symp. on Foundations of Computer Science, IEEE, pp. 100–112.

  • Gabow, H. (1976), An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs,J. Assoc. Comput. Mach.,23, 221–234.

    MATH  MathSciNet  Google Scholar 

  • Gallager, R., Humblet, P., and Spira, P. (1983), A Distributed Algorithm for Minimum-Weight Spanning Trees,ACM Trans. Programm. Lang. Systems,5, 66–77.

    Article  MATH  Google Scholar 

  • Hopcroft, J. E., and Karp, R. M. (1973), Ann 2,5 Algorithm for Maximum Matching in Bipartite Graphs,SIAM J. Comput.,2, 225–231.

    Article  MATH  MathSciNet  Google Scholar 

  • Kameda, T., and Munro, I. (1974), AO(¦V¦¦E¦) Algorithm for Maximum Matching of Graphs,Computing, 12, 91–98.

    Article  MATH  MathSciNet  Google Scholar 

  • Micali, S., and Vazirani, V. (1980), AnO(√¦v¦¦E¦) Algorithm for Finding Maximum Matching in General Graphs,Proc. 21st Annual IEEE Symp. on Foundations of Computer Science, IEEE, pp. 17–27.

  • Papadimitriou, C., and Steiglitz, K. (1982),Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ.

    MATH  Google Scholar 

  • Peterson, P., and Loui, M. (1988), The General Maximum Matching Algorithm of Micali and Vazirani,Algorithmica,3, 511–533.

    Article  MATH  MathSciNet  Google Scholar 

  • Schieber, B., and Moran, S. (1986), Slowing Sequential Algorithms for Obtaining Fast Distributed and Parallel Algorithms: Maximum Matchings,Proc. 5th Annual ACM Symp. on Principles of Distributed Computing, pp. 282–292.

  • Wu, M. (1987), An Efficient Distributed Algorithm for Maximum Matching in General Graphs, Technical Report ACT-73, Coordinated Science Laboratory, University of Illinois at Urbana-Champaign.

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering and Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 61801, Urbana, IL, USA

    Michael M. Wu & Michael C. Loui

Authors
  1. Michael M. Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael C. Loui
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Communicated by C. K. Wong.

Work on this paper has been supported by the Office of Naval Research under Contract N00014-85-K-0570.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wu, M.M., Loui, M.C. An efficient distributed algorithm for maximum matching in general graphs. Algorithmica 5, 383–406 (1990). https://doi.org/10.1007/BF01840395

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01840395

Key words

Search

Navigation