Sciweavers

CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 5 months ago
Hitting forbidden minors: Approximation and Kernelization
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
Fedor V. Fomin, Daniel Lokshtanov, Neeldhara Misra...