The general maximum matching algorithm of micali and vazirani

  title={The general maximum matching algorithm of micali and vazirani},
  author={Paul A. Peterson and Michael C. Loui},
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(n 1/2 m) time. 

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 13 references

The general maximum matching algorithm of Micali and

  • Prentice-Hall, Englewood Cliffs, P. A. NJ. Peterson
  • 1985

Data Structures and Network Algorithms , Society for Industrial and Applied Mathematics , Philadelphia , PA .

  • R. E. Tarjan
  • 1983
1 Excerpt

Efficiency of a good but not linear set union algorithm, J

  • Prentice-Hall, Englewood Cliffs, R. E. NJ. Tarjan
  • 1975

Similar Papers

Loading similar papers…