Algorithmica

, Volume 3, Issue 1, pp 511–533

The general maximum matching algorithm of micali and vazirani

Authors

  • Paul A. Peterson
    • Department of Electrical and Computer Engineering and Coordinated Science LaboratoryUniversity of Illinois at Urbana-Champaign
  • Michael C. Loui
    • Department of Electrical and Computer Engineering and Coordinated Science LaboratoryUniversity of Illinois at Urbana-Champaign
Article

DOI: 10.1007/BF01762129

Cite this article as:
Peterson, P.A. & Loui, M.C. Algorithmica (1988) 3: 511. doi:10.1007/BF01762129

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(n1/2m) time.

Key words

MatchingGraph algorithmCombinatorial optimization

Copyright information

© Springer-Verlag New York Inc. 1988