Approximating the pathwidth of outerplanar graphs (Q293398)
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: Approximating the pathwidth of outerplanar graphs |
scientific article; zbMATH DE number 6590770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the pathwidth of outerplanar graphs |
scientific article; zbMATH DE number 6590770 |
Statements
Approximating the pathwidth of outerplanar graphs (English)
0 references
9 June 2016
0 references
graph algorithms
0 references
pathwidth
0 references
outerplanar graphs
0 references
approximation
0 references
tree decomposition
0 references
0 references
0.9155194759368896
0 references
0.8294199705123901
0 references
0.7986268401145935
0 references
0.7874671816825867
0 references
