Pages that link to "Item:Q5369540"
From MaRDI portal
The following pages link to Graph Motif Problems Parameterized by Dual (Q5369540):
Displaying 3 items.
- The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (Q2220833) (← links)
- Algorithmic Aspects of the Maximum Colorful Arborescence Problem (Q2988823) (← links)
- The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781) (← links)