Set-merging for the Matching Algorithm of Micali and Vazirani
Abstract
The algorithm of Micali and Vazirani MV finds a maximum cardinality matching in time O( n m) if an efficient set-merging algorithm is used. The latter is provided by the incremental-tree set-merging algorithm of GabTar. Details of this application to matching were omitted from GabTar and are presented in this note.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.