The general maximum matching algorithm of micali and vazirani
- 402 Downloads
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 wordsMatching Graph algorithm Combinatorial optimization
Unable to display preview. Download preview PDF.
- Bondy, J. A., and Murty, U. S. R. (1976),Graph Theory with Applications, Elsevier North-Holland, New York.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.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
- 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.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.Google Scholar
- Reingold, E. M., Nievergelt, J., and Deo, N. (1977),Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs, NJ.Google Scholar
- Tarjan, R. E. (1983),Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA.Google Scholar