@inproceedings{bb312e8585e041848b8ab4f94bcc7ebc,

title = "Testing for a theta",

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

author = "Maria Chudnovsky and Paul Seymour",

note = "Publisher Copyright: Copyright {\textcopyright} 2007 by the Association for Computing Machinery, Inc. and the Society for Industrial and Applied Mathematics.; 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 ; Conference date: 07-01-2007 Through 09-01-2007",

year = "2007",

language = "English (US)",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery",

pages = "595--598",

booktitle = "Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007",

}