@article{Mulmuley:1987aa,
Abstract = {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.},
Author = {Mulmuley, Ketan and Vazirani, Umesh V. and Vazirani, Vijay V.},
File = {Matching is as easy as matrix inversion - Mulmuley1987\_Article\_MatchingIsAsEasyAsMatrixInvers - a - d.pdf},
ISBN = {1439-6912},
Journal = {Combinatorica},
Number = {1},
Pages = {105--113},
Title = {Matching is as easy as matrix inversion},
URL = {https://doi.org/10.1007/BF02579206},
Volume = {7},
Year = {1987},
bdsk-url-1 = {https://doi.org/10.1007/BF02579206},
da = {1987/03/01},
date-added = {2020-10-25 12:29:06 +0100},
date-modified = {2020-10-25 12:29:06 +0100},
id = {Mulmuley1987},
ty = {JOUR},
doi = {10.1007/BF02579206}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A