Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs (Q2839212)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs |
scientific article |
Statements
Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs (English)
0 references
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
