Hitting minors on bounded treewidth graphs. III. Lower bounds (Q2301360)
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: Hitting minors on bounded treewidth graphs. III. Lower bounds |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hitting minors on bounded treewidth graphs. III. Lower bounds |
scientific article |
Statements
Hitting minors on bounded treewidth graphs. III. Lower bounds (English)
0 references
24 February 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.9245492219924928
0 references
0.8995480537414551
0 references
0.8916945457458496
0 references
0.8815926909446716
0 references
0.8519762754440308
0 references
