Login / Signup
Parameterized complexity dichotomy for (r, ℓ)-Vertex Deletion.
Julien Baste
Luérbio Faria
Sulamita Klein
Ignasi Sau
Published in:
CoRR (2015)
Keyphrases
</>
parameterized complexity
fixed parameter tractable
global constraints
vertex set
symmetry breaking
np complete
directed graph
computational complexity
bounded treewidth