The role of planarity in connectivity problems parameterized by treewidth (Q2514121)
From MaRDI portal
(Redirected from Item:Q2946008)
 | 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: The role of planarity in connectivity problems parameterized by treewidth |
scientific article; zbMATH DE number 6482347
- The Role of Planarity in Connectivity Problems Parameterized by Treewidth
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The role of planarity in connectivity problems parameterized by treewidth |
scientific article; zbMATH DE number 6482347 |
|
Statements
The role of planarity in connectivity problems parameterized by treewidth (English)
0 references
The Role of Planarity in Connectivity Problems Parameterized by Treewidth (English)
0 references
30 January 2015
0 references
15 September 2015
0 references
parameterized complexity
0 references
treewidth
0 references
connectivity problems
0 references
single-exponential algorithms
0 references
planar graphs
0 references
dynamic programming
0 references
0 references
0 references
0 references
0.9999997
0 references
0 references
0.90558535
0 references
0.90346885
0 references
0.9027522
0 references
0.8971254
0 references
0.8911059
0 references
0.8870854
0 references
