Known algorithms on graphs of bounded treewidth are probably optimal (Q4554340)
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 6979203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Known algorithms on graphs of bounded treewidth are probably optimal |
scientific article; zbMATH DE number 6979203 |
Statements
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (English)
0 references
13 November 2018
0 references
SETH
0 references
treewidth
0 references
lower bounds
0 references
0.8284320831298828
0 references
0.8261191248893738
0 references
0.8216132521629333
0 references
0.8208569288253784
0 references
