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}
}
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. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 471 CITATIONS

Fast Hamiltonicity Checking Via Bases of Perfect Matchings

VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

L O ] 5 A pr 2 01 7 Reachability is in DynFO

VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Shortest k-Disjoint Paths via Determinants

VIEW 5 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Exact Algorithms for L OOP C UTSET

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Fast hamiltonicity checking via bases of perfect matchings

VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

VIEW 8 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

Isolation of Matchings via Chinese

VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Randomized parallel algorithms

VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Finding Hamiltonian Cycle in Graphs of Bounded Treewidth: Experimental Evaluation

VIEW 6 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

1986
2020

CITATION STATISTICS

  • 59 Highly Influenced Citations

  • Averaged 29 Citations per year from 2017 through 2019