Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth (Q5111863)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth |
scientific article; zbMATH DE number 7205188
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth |
scientific article; zbMATH DE number 7205188 |
Statements
27 May 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.9227977395057678
0 references
0.9219974875450134
0 references
0.8995480537414551
0 references
0.8774593472480774
0 references
