The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781)
From MaRDI portal
scientific article; zbMATH DE number 7286743
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph |
scientific article; zbMATH DE number 7286743 |
Statements
16 December 2020
0 references
subgraph problem
0 references
computational complexity
0 references
fixed-parameter tractability
0 references
kernelization
0 references
cs.CC
0 references
cs.DS
0 references
math.CO
0 references
