Testing for a theta

Authors:
Maria Chudnovsky;Paul Seymour
Affiliations:
Columbia Univerisity, New York, NY;Princeton University, Princeton, NJ
Venue:
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2007

Citing 6
Cited 3

On the complexity of testing for odd holes and induced odd paths

Discrete Mathematics
Testing balancedness and perfection of linear matrices

Mathematical Programming: Series A and B
Recognizing Berge Graphs

Combinatorica
Algorithms for Perfectly Contractile Graphs

SIAM Journal on Discrete Mathematics
Even-hole-free graphs part II: Recognition algorithm

Journal of Graph Theory
Detecting even holes

Journal of Graph Theory

Problems column

ACM Transactions on Algorithms (TALG)
Induced disjoint paths problem in a planar digraph

Discrete Applied Mathematics
A faster algorithm to recognize even-hole-free graphs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we survey some known results on the question of testing whether a given graph contains certain induced subgraphs. We also present a new algorithm, to test if a graph contains a special kind of an induced subgraph, called a "theta"