Abstract
A new algorithm for finding a maximum matching in a general graph is presented; its special feature being that the only computationally non-trivial step required in its execution is the inversion of a single integer matrix. Since this step can be parallelized, we get a simple parallel (RNC**2) algorithm. At the heart of our algorithm lies a probabilistic lemma, the isolating lemma. We show applications of this lemma to parallel computation and randomized reductions.
Cite
CITATION STYLE
Mulmuley, K., Vazirani, U. V., & Vazirani, V. V. (1987). MATCHING IS AS EASY AS MATRIX INVERSION. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 345–354). ACM. https://doi.org/10.1145/28395.383347
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
