Approximating the treewidth of AT-free graphs. (Q1408810)
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 treewidth of AT-free graphs. |
scientific article; zbMATH DE number 1985915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating the treewidth of AT-free graphs. |
scientific article; zbMATH DE number 1985915 |
Statements
Approximating the treewidth of AT-free graphs. (English)
0 references
25 September 2003
0 references
Graph algorithms
0 references
Treewidth
0 references
AT-free graphs
0 references
0.9129764
0 references
0 references
0.8984748
0 references
0 references
0.8903208
0 references
0 references
0.88574517
0 references
