Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2010.02.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2016465035 / rank | |||
Normal rank | |||
Revision as of 20:56, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs |
scientific article |
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
