Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316)
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: Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm |
scientific article; zbMATH DE number 5702589
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm |
scientific article; zbMATH DE number 5702589 |
Statements
Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (English)
0 references
28 April 2010
0 references
dynamic programming
0 references
tree-decomposition
0 references
branch-decomposition
0 references
path-decomposition
0 references
dominating set
0 references
brachwidth
0 references
treewidth
0 references
0 references
