Sciweavers

Share
DAM
2008

Planar graph bipartization in linear time

9 years 7 months ago
Planar graph bipartization in linear time
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transversal of size at most k.
Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where DAM
Authors Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
Comments (0)
books