Set-merging for the Matching Algorithm of Micali and Vazirani

preprint2014arXivOpen access

The algorithm of Micali and Vazirani \cite{MV} finds a maximum cardinality matching in time $O(\sqrt n m)$ 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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Set-merging for the Matching Algorithm of Micali and Vazirani

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0