Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion.

Julien Baste Luérbio Faria Sulamita Klein Ignasi Sau

Published in: Theory Comput. Syst. (2017)

Keyphrases

parameterized complexity
fixed parameter tractable
global constraints
symmetry breaking
undirected graph
np complete
directed graph