Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Simpler Parameterized Algorithm for OCT
Combinatorial Algorithms
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
ACM Transactions on Computation Theory (TOCT)
Finding odd cycle transversals
Operations Research Letters
| Hi-index | 0.89 |
Given a graph G and an odd cycle transversal T, we describe an elegant O^@?(2^|^T^|) algorithm for determining whether G has a smaller odd cycle transversal that is disjoint from T. We believe that our algorithm, based on a reduction to Vertex Cover, is conceptually simpler than the known algorithms for the problem and refines the understanding of the relationship between Odd Cycle Transversal and Vertex Cover.