Treewidth: Algorithmic techniques and results (Q4699283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1361465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Treewidth: Algorithmic techniques and results |
scientific article; zbMATH DE number 1361465 |
Statements
3 August 2000
0 references
treewidth
0 references
algorithms
0 references
minors
0 references
0.8981482982635498
0 references
0.8915106654167175
0 references
0.878113865852356
0 references
Treewidth: Algorithmic techniques and results (English)
0 references
This is a short survey paper on treewidth. Results and techniques for algorithms that compute the treewidth of a graph are considered. Several algorithms solving difficult problems for graphs with restricted treewidth are also considered. Some results on graph minors are reviewed. For the entire collection see [Zbl 0920.00047].
0 references
