Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion}
From MaRDI portal
Publication:2408559
DOI10.1007/s00224-016-9716-yzbMath1378.68057arXiv1504.05515MaRDI QIDQ2408559
Ignasi Sau, Sulamita Klein, Julien Baste, Luérbio Faria
Publication date: 12 October 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.05515
parameterized complexity; graph modification problem; FPT-algorithm; iterative compression; single-exponential algorithm
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
