Login / Signup
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems.
Michael R. Fellows
Jiong Guo
Hannes Moser
Rolf Niedermeier
Published in:
ACM Trans. Comput. Theory (2011)
Keyphrases
</>
similar problems
benchmark problems
decision problems
combinatorial problems
computational issues
efficient solutions
specific problems
search methods
solution space
test problems
problems involving
optimal solution
approximate solutions
np hardness
optimal or near optimal
directed graph
polynomial hierarchy