• Mathematics, Computer Science
• Published in Combinatorica 1987
• DOI:10.1007/BF02579206

Matching is as easy as matrix inversion

@article{Mulmuley1987MatchingIA,
  title={Matching is as easy as matrix inversion},
  author={Ketan Mulmuley and Umesh V. Vazirani and Vijay V. Vazirani},
  journal={Combinatorica},
  year={1987},
  volume={7},
  pages={105-113}
}

• Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani

View on Springer

Alternate Sources

Save to Library

Create Alert

Cite

We present a new algorithm for finding a maximum matching in a general graph. The special feature of our algorithm is that its only computationally non-trivial step is the inversion of a single integer matrix. Since this step can be parallelized, we get a simple parallel (RNC2) algorithm. At the heart of our algorithm lies a probabilistic lemma, the isolating lemma. We show other applications of this lemma to parallel computation and randomized reductions.