Speeding up Exact Algorithms With High Probability
References (7)
- et al.
A note on triangle-free and bipartite graphs
Discrete Mathematics
(2002) - et al.
Finding odd cycle transversals
Operations Research Letters
(2004) - et al.
Parameterized Complexity
(1999)
There are more references available in the full text version of this article.
Cited by (1)
Kernelization for cycle transversal problems
2010, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 2006 Elsevier B.V. All rights reserved.