Corpus ID: 7006120

A Simplification of the MV Matching Algorithm and its Proof

@article{Vazirani2012ASO,
  title={A Simplification of the MV Matching Algorithm and its Proof},
  author={V. Vazirani},
  journal={arXiv: Data Structures and Algorithms},
  year={2012}
}
  • V. Vazirani
  • Published 2012
  • Computer Science, Mathematics
  • arXiv: Data Structures and Algorithms
  • For all practical purposes, the Micali-Vazirani [MV80] general graph maximum matching algorithm is still the most ecient 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. 
    Finding large matchings in 1-planar graphs of minimum degree 3
    The Weighted Matching Approach to Maximum Cardinality Matching
    • H. Gabow
    • Computer Science, Mathematics
    • 2017
    8
    Linear-Time Parameterized Algorithms with Limited Local Resources
    Greedy Matching: Guarantees and Limitations
    10
    Distributed Maximum Matching Verification in CONGEST
    Cheminformatics for genome-scale metabolic reconstructions
    4

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 34 REFERENCES
    Matching is as easy as matrix inversion
    545
    A New Approach to Maximum Matching in General Graphs
    72
    An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs
    1840
    A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs
    886
    Maximum matchings via Gaussian elimination
    269
    Maximum skew-symmetric flows and matchings
    49
    Faster scaling algorithms for general graph matching problems
    287
    The Complexity of Computing the Permanent
    2267
    Maximum matching and a polyhedron with 0,1-vertices
    1266