Pages that link to "Item:Q5140781"

The following pages link to The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781):

Displayed 2 items.

• The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (Q2220833) ‎ (← links)
• Graph Motif Problems Parameterized by Dual (Q5119384) ‎ (← links)