Chordless paths through three vertices
Authors:
- Robert HaasRHRobert Haas
- Michael HoffmannMHMichael Hoffmann
- 1 February 2006
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 351 (3) , 360-371
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- A polynomial algorithm for recognizing perfect graphs2004
- The Turing way to parameterized complexityJournal of Computer and System Sciences, 2003
- Perfect Code is W[1]-completeInformation Processing Letters, 2002
- Parameterized Complexity1999
- On the efficiency of polynomial time approximation schemesInformation Processing Letters, 1997
- On the parameterized complexity of short computation and factorizationArchive for Mathematical Logic, 1997
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- The parameterized complexity of some problems in logic and linguistics1994
- On the complexity of testing for odd holes and induced odd pathsDiscrete Mathematics, 1991
- The Robertson-Seymour theorems: a survey of applications1989