Planar graph bipartization in linear time

13 years 4 months ago

Download homepages.ulb.ac.be

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

Real-time Traffic

Cycle Vertex Transversal | DAM 2008 | Linear Time | Planar Graph |

claim paper

» LinearTime Algorithms for Parametric Minimum Spanning Tree Problems on Planar Graphs

» New LinearTime Algorithms for EdgeColoring Planar Graphs

» Linear Time Planarity Testing and Embedding of Strongly Connected Cyclic Level Graphs

» Minimum Depth Graph Embedding

» A Linear Time Algorithm For Finding Maximal Planar Subgraphs

» Planarity Allowing Few Error Vertices in Linear Time

» A LinearTime Approximation Scheme for TSP in Undirected Planar Graphs with EdgeWeights

» Radial Level Planarity Testing and Embedding in Linear Time

Post Info
More Details (n/a)

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)

Sciweavers

Planar graph bipartization in linear time

Cycle Vertex Transversal | DAM 2008 | Linear Time | Planar Graph |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers