Pages that link to "Item:Q2354588"

The following pages link to Some results on more flexible versions of Graph Motif (Q2354588):

Displaying 2 items.

• Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
• The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (Q2220833) (← links)