Maximum Matchings in Planar Graphs via Gaussian Elimination

15 years 10 months ago

Download www.mimuw.edu.pl

We present a randomized algorithm for ﬁnding 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

Marcin Mucha, Piotr Sankowski

Real-time Traffic

ESA 2004 | Matrix Multiplication Algorithm | Maximum Matchings | Randomized Algorithm |

claim paper

» Eliminating graphs by means of parallel knockout schemes

» Efficient Shape Matching Via Graph Cuts

» Counting Subgraphs via Homomorphisms

» A matching based decomposer for double patterning lithography

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ESA
Authors	Marcin Mucha, Piotr Sankowski

Comments (0)

Sciweavers

Maximum Matchings in Planar Graphs via Gaussian Elimination

ESA 2004 | Matrix Multiplication Algorithm | Maximum Matchings | Randomized Algorithm |

Explore & Download

Productivity Tools

Sciweavers