Maximum Matchings in Planar Graphs via Gaussian Elimination

We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Since ω < 2.38, this

• Type: Conference
• Year: 2004
• Where: ESA
• Authors: Marcin Mucha, Piotr Sankowski
• Keywords: ESA 2004, Matrix Multiplication Algorithm, Maximum Matchings, Randomized Algorithm