| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420624 | Discrete Applied Mathematics | 2008 | 6 Pages |
Abstract
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transversal of size at most k.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Samuel Fiorini, Nadia Hardy, Bruce Reed, Adrian Vetta,