Computing Graph Distances Parameterized by Treewidth and Diameter (Q4634399)
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: Computing Graph Distances Parameterized by Treewidth and Diameter |
scientific article; zbMATH DE number 6857812
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing Graph Distances Parameterized by Treewidth and Diameter |
scientific article; zbMATH DE number 6857812 |
Statements
10 April 2018
0 references
graph algorithms
0 references
diameter
0 references
treewidth
0 references
strong exponential time hypothesis
0 references
Computing Graph Distances Parameterized by Treewidth and Diameter (English)
0 references
