6 search results - page 2 / 2 » Polynomial Kernels for Deletion to Classes of Acyclic Digrap... |
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...