Even-hole-free graphs part II: Recognition algorithm

Authors:
Michele Conforti;Gérard Cornuéjols;Ajai Kapoor;Kristina Vušković
Affiliations:
Dipartimento di Matematica Pura Ed Applicata, Universitá di Padova, via Belzoni 7, 35131 Padova, Italy;Carnegie Mellon University, Schenley Park, Pittsburgh, Pennsylvania 15213;Speedtomarket, 510 Shadowgraph Dr San Jose, CA95110;School of Computing, University of Leeds, Leeds LS29JT, United Kingdom
Venue:
Journal of Graph Theory
Year:
2002

Citing 0
Cited 18

Decomposition of odd-hole-free graphs by double star cutsets and 2-joins

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
The NP-completeness column

ACM Transactions on Algorithms (TALG)
A polynomial recognition algorithm for balanced matrices

Journal of Combinatorial Theory Series B
Testing for a theta

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Decomposing Berge graphs and detecting balanced skew partitions

Journal of Combinatorial Theory Series B
Bisimplicial vertices in even-hole-free graphs

Journal of Combinatorial Theory Series B
Algorithms for finding an induced cycle in planar graphs and bounded genus graphs

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences

Journal of Combinatorial Theory Series B
Induced Packing of Odd Cycles in a Planar Graph

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs

Theoretical Computer Science
The induced disjoint paths problem

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Shortest paths between shortest paths and independent sets

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Combinatorial optimization with 2-joins

Journal of Combinatorial Theory Series B
A faster algorithm to recognize even-hole-free graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Induced packing of odd cycles in planar graphs

Theoretical Computer Science
Complexity of independent set reconfigurability problems

Theoretical Computer Science
Decomposition of even-hole-free graphs with star cutsets and 2-joins

Journal of Combinatorial Theory Series B
Detecting 2-joins faster

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an algorithm that determines in polytime whether a graph contains an even hole. The algorithm is based on a decomposition theorem for even-hole-free graphs obtained in Part I of this work. We also give a polytime algorithm to find an even hole in a graph when one exists. © 2002 Wiley Periodicals, Inc. J Graph Theory 40: 238–266, 2002