Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} |
scientific article |
Statements
Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (English)
0 references
12 October 2017
0 references
graph modification problem
0 references
parameterized complexity
0 references
iterative compression
0 references
FPT-algorithm
0 references
single-exponential algorithm
0 references
0 references
0 references
