Skip to main content
SpringerLink
Log in

The general maximum matching algorithm of micali and vazirani

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We give a clear exposition of the algorithm of Micali and Vazirani for computing a maximum matching in a general graph. This is the most efficient algorithm known for general matching. On a graph withn vertices andm edges this algorithm runs inO(n 1/2 m) time.

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

  • Aho, A. V., Hopcroft, J. E., and Ullman, J. D. (1974),The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA.

    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 

  • Bondy, J. A., and Murty, U. S. R. (1976),Graph Theory with Applications, Elsevier North-Holland, New York.

    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 Ann. Symp. on Foundations of Computer Science, IEEE, pp. 100–112.

  • Fujii, M., Kasami, T., and Ninomiya, K. (1969), Optimal sequencing of two equivalent processors,SIAM J. Appl. Math. 17, 784–789.

    Article  MATH  MathSciNet  Google Scholar 

  • Gabow, H. N. (1976), An efficient implementation of Edmonds' algorithm for maximum matching on graphs,J. Assoc. Comput. Mach. 23, 221–234.

    MATH  MathSciNet  Google Scholar 

  • Gabow, H. N., and Tarjan, R. E. (1985), A linear-time algorithm for a special case of disjoint set union,J. Comput. System Sci. 30, 209–221.

    Article  MATH  MathSciNet  Google Scholar 

  • Hajek, B. (1984), Link schedules, flows, and the multichromatic index of graphs,Proc. 1984 Conf. on Information Sciences and Systems, Princeton University, Princeton, NJ, pp. 498–502.

    Google Scholar 

  • Hopcroft, J. E., and Karp, R. M. (1973), Ann 5/2 algorithm for maximum matching in bipartite graphs,SIAM J. Comput. 2, 225–231.

    Article  MATH  MathSciNet  Google Scholar 

  • Kameda, T., and Munro, I. (1974), AnO(¦V¦ · ¦E¦) algorithm for maximum matching of graphs,Computing 12, 91–98.

    Article  MATH  MathSciNet  Google Scholar 

  • Micali, S., and Vazirani, V. (1980), An O(√¦v∥E¦) algorithm for finding maximum matching in general graphs,Proc. 21st Ann. Symp. on Foundations of Computer Science, IEEE, pp. 17–27.

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

    MATH  Google Scholar 

  • Peterson, P. A. (1985), The general maximum matching algorithm of Micali and Vazirani, Tech. Rep. ACT-62, Coordinated Sci. Lab., Univ. Illinois at Urbana-Champaign, Aug. 1985.

  • Reingold, E. M., Nievergelt, J., and Deo, N. (1977),Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, NJ.

    Google Scholar 

  • Tarjan, R. E. (1975), Efficiency of a good but not linear set union algorithm,J. Assoc. Comput. Mach. 22, 215–225.

    MATH  MathSciNet  Google Scholar 

  • Tarjan, R. E. (1983),Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA.

    Google Scholar 

Download references

Author information

Author notes

  1. Paul A. Peterson

    Present address: NCR Corporation, 1601 South Main Street, 45479, Dayton, OH, USA

Authors and Affiliations

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

    Paul A. Peterson & Michael C. Loui

Authors
  1. Paul A. Peterson
    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 and by the Eastman Kodak Company.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peterson, P.A., Loui, M.C. The general maximum matching algorithm of micali and vazirani. Algorithmica 3, 511–533 (1988). https://doi.org/10.1007/BF01762129

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Key words

Search

Navigation