Maximum matchings in planar graphs via gaussian elimination

@article{Mucha2004MaximumMI,
  title={Maximum matchings in planar graphs via gaussian elimination},
  author={Marcin Mucha and Piotr Sankowski},
  journal={Algorithmica},
  year={2004},
  volume={45},
  pages={3-20}
}
We present a randomized algorithm for finding maximum matchings in planar graphs in timeO(n ω/2), whereω is the exponent of the best known matrix multiplication algorithm. Sinceω<2.38, this algorithm breaks through theO(n 1.5) barrier for the matching problem. This is the first result of this kind for general planar graphs. We also present an algorithm for generating perfect matchings in planar graphs uniformly at random usingO(n ω/2) arithmetic operations. Our algorithms are based on the… CONTINUE READING
Highly Cited
This paper has 39 citations. REVIEW CITATIONS
26 Citations
20 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 20 references

editor: Graph Theory and Theoretical Physics

  • F. Harary
  • Chapter ”Graph Theory and Crystal Physics” by P.W…
  • 1967
Highly Influential
4 Excerpts

Generalized nested dissection

  • R. J. Lipton, D. J. Rose, R. Tarjan
  • SIAM J. Num. Anal. 16
  • 1979
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…