Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs (Q4895809)
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: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs |
scientific article; zbMATH DE number 936175
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs |
scientific article; zbMATH DE number 936175 |
Statements
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs (English)
0 references
11 May 1997
0 references
pathwidth
0 references
0.8540884852409363
0 references
0.849614679813385
0 references
