Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} (Q2408559)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6790465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity dichotomy for \((r, \ell)\)-\textsc{Vertex Deletion} |
scientific article; zbMATH DE number 6790465 |
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
0.8626296520233154
0 references
0.8288801312446594
0 references
0.7943155765533447
0 references
0.7905083894729614
0 references
0.7883449196815491
0 references
