# A Simplification of the MV Matching Algorithm and its Proof

@article{Vazirani2012ASO, title={A Simplification of the MV Matching Algorithm and its Proof}, author={V. Vazirani}, journal={arXiv: Data Structures and Algorithms}, year={2012} }

For all practical purposes, the Micali-Vazirani [MV80] general graph maximum matching algorithm is still the most ecient known algorithm for the problem. The purpose of this paper is to provide a complete proof of correctness of the algorithm in the simplest possible terms; graph-theoretic machinery developed for this purpose also helps simplify the algorithm.

#### Paper Mentions

9 Citations

Monotone Projection Lower Bounds from Extended Formulation Lower Bounds

- Computer Science, Mathematics
- 2015

3

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 34 REFERENCES

An O(v|v| c |E|) algoithm for finding maximum matching in general graphs

- Computer Science, Mathematics
- 1980

778