The general maximum matching algorithm of micali and vazirani
- Cite this article as:
- Peterson, P.A. & Loui, M.C. Algorithmica (1988) 3: 511. doi:10.1007/BF01762129
- 371 Views
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.