Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694)
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 degree-constrained subgraph problems on planar graphs |
scientific article; zbMATH DE number 5772515
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs |
scientific article; zbMATH DE number 5772515 |
Statements
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (English)
0 references
18 August 2010
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
0 references
0.9710230827331544
0 references
0.8145659565925598
0 references
0.8044785857200623
0 references
0.7973918318748474
0 references
0.7864704728126526
0 references
