A Simplification of the MV Matching Algorithm and its Proof
Data Structures and Algorithms
2013-08-27 v5
Abstract
For all practical purposes, the Micali-Vazirani general graph maximum matching algorithm is still the most efficient 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.
Keywords
Cite
@article{arxiv.1210.4594,
title = {A Simplification of the MV Matching Algorithm and its Proof},
author = {Vijay V. Vazirani},
journal= {arXiv preprint arXiv:1210.4594},
year = {2013}
}