# The general maximum matching algorithm of micali and vazirani

Article

- Received:
- Revised:

DOI: 10.1007/BF01762129

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

- 10 Citations
- 377 Views

## 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 with*n* vertices and*m* edges this algorithm runs in*O*(*n*^{1/2}*m*) time.

### Key words

MatchingGraph algorithmCombinatorial optimization## Copyright information

© Springer-Verlag New York Inc. 1988