Planar graph bipartization in linear time

Authors:
Samuel Fiorini;Nadia Hardy;Bruce Reed;Adrian Vetta
Affiliations:
GERAD HEC Montreal, Montreal, Québec, Canada and Department of Mathematics, Université Libre de Bruxelles, Brussels, Belgium;Department of Mathematics and Statistics, McGill University, Montreal, Québec, Canada;School of Computer Science, McGill University, Montreal, Québec, Canada;Department of Mathematics and Statistics and School of Computer Science, McGill University, Montreal, Québec, Canada
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 11
Cited 4

Graph minors. V. Excluding a planar graph

Journal of Combinatorial Theory Series B
The monadic second-order logic of graphs. I. recognizable sets of finite graphs

Information and Computation
Easy problems for tree-decomposable graphs

Journal of Algorithms
Planar Separators

SIAM Journal on Discrete Mathematics
Quickly excluding a planar graph

Journal of Combinatorial Theory Series B
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Wavelength conversion in optical networks

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Planarity Testing

Journal of the ACM (JACM)
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Edge-disjoint odd cycles in planar graphs

Journal of Combinatorial Theory Series B
Finding odd cycle transversals

Operations Research Letters

An (almost) linear time algorithm for odd cycles transversal

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Compression via matroids: a randomized polynomial kernel for odd cycle transversal

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Known algorithms on graphs of bounded treewidth are probably optimal

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
On polynomial kernels for structural parameterizations of odd cycle transversal

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation

Quantified Score

Hi-index	0.05

Visualization

Abstract

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.