Sciweavers

COCO
2010
Springer
131views Algorithms» more  COCO 2010»
13 years 8 months ago
On the Matching Problem for Special Graph Classes
An even cycle in a graph is called nice by Lov
Thanh Minh Hoang
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
14 years 4 months ago
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. Sin...
Marcin Mucha, Piotr Sankowski