Pages that link to "Item:Q2988823"
From MaRDI portal
The following pages link to Algorithmic Aspects of the Maximum Colorful Arborescence Problem (Q2988823):
Displaying 7 items.
- The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (Q2220833) (← links)
- Heuristic Algorithms for the Maximum Colorful Subtree Problem (Q5090364) (← links)
- Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
- The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781) (← links)
- Algorithms for coloring quadtrees (Q5956834) (← links)
- Precedence-constrained arborescences (Q6109804) (← links)
- A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem (Q6164630) (← links)