On the parameterized complexity of computing tree-partitions (Q6969005)
From MaRDI portal
!
WARNING
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 8055113
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of computing tree-partitions |
scientific article; zbMATH DE number 8055113 |
Statements
On the parameterized complexity of computing tree-partitions (English)
0 references
23 June 2025
0 references
parameterized algorithms
0 references
tree partitions
0 references
tree-partition-width
0 references
treewidth
0 references
domino treewidth
0 references
approximation algorithms
0 references
parameterized complexity
0 references
