Downey, Fellows (The Vertex Cover Problem The Vertex Cover Problem)
Jump to navigation
Jump to search
Time Complexity
$O(kn+{2}^k k^{2})$
Space Complexity
$O(k^{2})$ auxiliary words
(Auxiliary graph contains O(k^2) edges unless the instance is rejected; rest of steps take O(k) auxiliary space at most)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1995
Reference
https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.2.7270&rep=rep1&type=pdf