129
click to vote
COCO
2010
Springer
15 years 1 months ago
2010
Springer
An even cycle in a graph is called nice by Lov
120
click to vote
ESA
2004
Springer
15 years 10 months ago
2004
Springer
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...