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. 

Parallel Algorithms for Perfect Matching

The perfect matching problem has a randomized NC-algorithm based on the Isolation Lemma of Mulmuley, Vazirani and Vazirani. We give an almost complete derandomization of the Isolation Lemma for

Guest Column: Parallel Algorithms for Perfect Matching

An almost complete derandomization of the Isolation Lemma for perfect matchings in bipartite graphs is given, giving a deterministic quasi-NC-algorithm for the bipartites perfect matching problem.

An Algebraic Matching Algorithm

  • J. Geelen
  • Mathematics, Computer Science
    Comb.
  • 2000
Using linear algebra and ideas from the Gallai–Edmonds decomposition, this work describes a very simple yet efficient algorithm that replaces the indeterminates with constants without losing rank.

A New NCAlgorithm for Perfect Matching in Bipartite Cubic Graphs

A new approach to the problem of computing perfect matchings in fast deterministic parallel time is introduced, which yields a new algorithm which finds a perfect matching in bipartite cubic graphs in time O log n and O n n logn processors in the arbitrary CRCW PRAM model.

A Combinatorial Algorithm for Pfa

The rst completely combinatorial algorithm for computing the Pfaaan in polynomial time is presented and it is shown that it can be computed in the complexity class GapL; this result was not known before.

The implementation and analysis of parallel algorithm for finding perfect matching in the bipartite graphs

This paper has attempted at implementing an algorithm for the perfect matching problem, which is also the central part of the algorithm for finding a maximum flow in a net, on a parallel computer with 12 processors.

A deterministic parallel algorithm for bipartite perfect matching

This article gives an almost complete derandomization of the Isolation Lemma for perfect matchings in bipartite graphs and presents three different ways of doing this construction with a common main idea.

Computing a Perfect Matching in a Line Graph

  • J. Naor
  • Computer Science, Mathematics
    AWOC
  • 1988
It is shown that a perfect matching of a line graph can be computed in NC by using a technique of dividing the graph into kingdoms, equivalent to partitioning the edge set of a graph into edge disjoint paths of even length.

Parallel algorithms for matching and independence problems in graphs and hypergraphs

We consider the following problem: Given a greedy graph algorithm that seems to be inherently sequential, to what extent can we expect to speed up the computation by making use of additional
...

References

SHOWING 1-10 OF 31 REFERENCES

The Two-Processor Scheduling Problem is in Random NC

A key ingredient of the algorithm is a generalization of a theorem of Tutte which establishes a one-to-one correspondence between the bases of the Tutte matrix of a graph and the sets of matched nodes in maximum matchings in the graph.

Fast parallel matrix and GCD computations

Constructing a perfect matching is in random NC

We show that the problem of constructing a perfect matching in a graph is in the complexity class Random NC; i.e., the problem is solvable in polylog time by a randomized parallel algorithm using a

Fast parallel matrix inversion algorithms

  • L. Csanky
  • Computer Science, Mathematics
    16th Annual Symposium on Foundations of Computer Science (sfcs 1975)
  • 1975
It will be shown in the sequel that the parallel arithmetic complexity of all these four problems is upper bounded by O(log2n) and the algorithms that establish this bound use a number of processors polynomial in n, disproves I. Munro's conjecture.

Improved processor bounds for algebraic and combinatorial problems in RNC

  • Z. GalilV. Pan
  • Computer Science, Mathematics
    26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
Given a problem for which we want to find a good parallel solution, our first goal is to establish that it is in NC (or RNC); that is, to solve it with a parallel algorithm in time t = O(logk n) with

A las vegas rnc algorithm for maximum matching

The min-max formula for the size of a maximum matching is used to convert any Monte Carlo maximum matching algorithm into a Las Vegas (error-free) one and the resulting algorithm returns (with high probability) amaximum matching and a certificate proving that the matching is indeed maximum.

The Design and Analysis of Computer Algorithms

This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.

A Taxonomy of Problems with Fast Parallel Algorithms

  • S. Cook
  • Computer Science, Mathematics
    Inf. Control.
  • 1985

The Complexity of Computing the Permanent

  • L. Valiant
  • Mathematics, Computer Science
    Theor. Comput. Sci.
  • 1979