Set-merging for the Matching Algorithm of Micali and Vazirani
Data Structures and Algorithms
2015-01-05 v1
Abstract
The algorithm of Micali and Vazirani \cite{MV} finds a maximum cardinality matching in time if an efficient set-merging algorithm is used. The latter is provided by the incremental-tree set-merging algorithm of \cite{GabTar}. Details of this application to matching were omitted from \cite{GabTar} and are presented in this note.
Keywords
Cite
@article{arxiv.1501.00212,
title = {Set-merging for the Matching Algorithm of Micali and Vazirani},
author = {Harold N. Gabow},
journal= {arXiv preprint arXiv:1501.00212},
year = {2015}
}