Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms |
scientific article |
Statements
Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (English)
0 references
12 March 2020
0 references
parameterized complexity
0 references
graph minors
0 references
treewidth
0 references
hitting minors
0 references
topological minors
0 references
dynamic programming
0 references
exponential time hypothesis
0 references
0 references
0 references
0 references
