Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs (Q2839212)
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: Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs |
scientific article; zbMATH DE number 6184190
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs |
scientific article; zbMATH DE number 6184190 |
Statements
4 July 2013
0 references
parameterized complexity
0 references
planar graphs
0 references
subexponential algorithm
0 references
branch decomposition
0 references
graph minors
0 references
bidimensionality
0 references
Catalan structures
0 references
0 references
0 references
0 references
Subexponential parameterized algorithms for bounded-degree connected subgraph problems on planar graphs (English)
0 references
