Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs (Q988694): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:13, 30 January 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
