Skip to main content
Springer Nature Link
Log in

A theory of alternating paths and blossoms for proving correctness of the\(O(\sqrt V E)\) general graph maximum matching algorithm

  • Published:
Combinatorica Aims and scope Submit manuscript

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. M. L. Balinski: Labelling to obtain a maximum matching, inCombinatorial Mathematics and its Application, Eds.: R. C. Bose and T. A. Downing, University of North Carolina Press, 1969, 585–602.

  2. C. Berge: Two theorems in graph theory,Proc. Natl, Acad. Sci. 43 (1957), 842–844.

    Google Scholar 

  3. N. Blum: A new approach to maximum matchings in general graphs, Proceedings of the 17th International Colloquium on Automata,Languages and Programming (1990), 586–597.

  4. J. Edmonds: Paths, trees, and flowers,Canad. J. Math. 17 (1965), 449–467.

    Google Scholar 

  5. S. Even, andO. Kariv: AnO(n 2.5) algorithm for maximum matching in general graphs,Proc. 16th Annual IEEE Symposium on Foundations of Computer Science (1975), 100–112.

  6. H. Gabow: An efficient implementation of Edmonds' algorithm for maximum matching on graphs,JACM 23 (1976), 221–234.

    Google Scholar 

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

    Google Scholar 

  8. H. N. Gabow, andR. E. Tarjan: Faster scaling algorithms for general graph matching problems, technical report CU-CS-432-89, University of Colorado at Boulder.

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

    Google Scholar 

  10. T. Kameda, andI. Munro: AO(|V||E|) algorithm for maximum matching of graphs,Computing 12 (1974), 91–98.

    Google Scholar 

  11. D. E. Knuth:The art of computer Programming, Vol. 1: Fundamental Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1973.

    Google Scholar 

  12. E. L. Lawler:Combinatorial Optimization: Network and Matroids, Holt, Rinehart and Winston, New York, 1976.

    Google Scholar 

  13. L. Lovász, andM. Plummer:Matching Theory, Academic Press, Budapest, Hungary, (1986).

    Google Scholar 

  14. S. Micali, andV. V. Vazirani: An\(O\left( {\sqrt {\left| V \right|} \left| E \right|} \right)\) algorithm for finding maximum matching in general graphs,Proc. 21st Annual IEEE Symposium in Foundation of Computer Science, 1980, 17–27.

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

    Google Scholar 

  16. C. Whitzgall, andC. Zahn: Modification of Edmonds' maximum matching algorithm,J. Res. Nat. Bur. Standards Sect. B69 (1965), 91–98.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science & Engg, Indian Institute of Technology, 110016, New Delhi, India

    Vijay V. Vazirani

Authors
  1. Vijay V. Vazirani
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Partially supported by an NSF PYI Grant with matching funds from AT&T Bell Labs at Cornell University

Rights and permissions

Reprints and permissions

About this article

Cite this article

Vazirani, V.V. A theory of alternating paths and blossoms for proving correctness of the\(O(\sqrt V E)\) general graph maximum matching algorithm. Combinatorica 14, 71–109 (1994). https://doi.org/10.1007/BF01305952

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS subject classification codes (1991)