Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm (Q967316): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:23, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm |
scientific article |
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
