Parameterized complexity: exponential speed-up for planar graph problems (Q4828563)
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: Parameterized complexity: exponential speed-up for planar graph problems |
scientific article; zbMATH DE number 2117876
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized complexity: exponential speed-up for planar graph problems |
scientific article; zbMATH DE number 2117876 |
Statements
Parameterized complexity: exponential speed-up for planar graph problems (English)
0 references
23 November 2004
0 references
Planar graph problems
0 references
Fixed-parameter tractability
0 references
Parameterized complexity
0 references
Tree decomposition
0 references
Graph separators
0 references
0.9686856269836426
0 references
0.8666291832923889
0 references
0.8573499321937561
0 references
