
Finding large matchings in 1planar graphs of minimum degree 3
A matching is a set of edges without common endpoint. It was recently sh...
read it

On the Maximum Weight Independent Set Problem in graphs without induced cycles of length at least five
A hole in a graph is an induced cycle of length at least 4, and an antih...
read it

Fully dynamic 3/2 approximate maximum cardinality matching in O(√(n)) update time
We present a randomized algorithm to maintain a maximal matching without...
read it

Distributed Maximum Matching Verification in CONGEST
We study the maximum cardinality matching problem in a standard distribu...
read it

A Cryptographic Hash Function from Markoff Triples
Cryptographic hash functions from expander graphs were proposed by Charl...
read it

Matching in Stochastically Evolving Graphs
This paper studies the maximum cardinality matching problem in stochasti...
read it

Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches
We study graph computations in an enhanced data streaming setting, where...
read it
A Proof of the MV Matching Algorithm
The MicaliVazirani (MV) algorithm for maximum cardinality matching in general graphs, which was published in 1980 <cit.>, remains to this day the most efficient known algorithm for the problem. This paper gives the first complete and correct proof of this algorithm. Central to our proof are some purely graphtheoretic facts, capturing properties of minimum length alternating paths; these may be of independent interest. An attempt is made to render the algorithm easier to comprehend.
READ FULL TEXT
Comments
There are no comments yet.