Work

Matching is as easy as matrix inversion

Year: 1987

Type: conference-paper

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 (RNC2) 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.

Source: ACM Symposium on Theory of Computing (STOC)

DOI: 10.1145/28395.383347

Authors: Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani

Institutions: University of California, Berkeley, Harvard University, Cornell University

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funder: National Science Foundation

Award: Two Blossoming Paradigms: Algebraic Methods for Computational Combinatoric Problems, and Randomized Reducibilities in Computational Complexity (Computer Res.)