Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms (Q2304558)
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 7179877
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms |
scientific article; zbMATH DE number 7179877 |
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
0.9219974875450134
0 references
0.910925567150116
0 references
0.8916945457458496
0 references
0.8704013228416443
0 references
