Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal (Q4554340): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1007.5450 / rank | |||
Normal rank | |||
Revision as of 18:14, 19 April 2024
scientific article; zbMATH DE number 6979203
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
