The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (Q2220833)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? |
scientific article |
Statements
The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (English)
0 references
25 January 2021
0 references
complexity
0 references
FPT algorithms
0 references
approximation algorithms
0 references
maximum colorful arborescence
0 references
tandem mass spectrometry
0 references
0 references
