New upper bounds on the decomposability of planar graphs (Q3376690)
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: New upper bounds on the decomposability of planar graphs |
scientific article; zbMATH DE number 5015033
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New upper bounds on the decomposability of planar graphs |
scientific article; zbMATH DE number 5015033 |
Statements
New upper bounds on the decomposability of planar graphs (English)
0 references
24 March 2006
0 references
tree-width
0 references
branch-width
0 references
separation theorems
0 references
parameterized algorithms
0 references
subexponential algorithms
0 references
0.9126426
0 references
0.90567136
0 references
0.90515774
0 references
0.89875454
0 references
0 references
0.8953264
0 references
0.89516556
0 references
0 references
