Subexponential Parameterized Algorithms for Bounded-Degree Connected Subgraph Problems on Planar Graphs (Q2839212): 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.endm.2009.02.009 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063956355 / rank | |||
Normal rank | |||
Revision as of 14:38, 19 March 2024
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
