Sciweavers

STOC
2010
ACM
274views Algorithms» more  STOC 2010»
14 years 1 months ago
Odd Cycle Packing
We study the ratio between the minimum size of an odd cycle vertex transversal and the maximum size of a collection of vertex-disjoint odd cycles in a planar graph. We show that th...
Ken-ichi Kawarabayashi and Bruce Reed