Pages that link to "Item:Q2354588"
From MaRDI portal
The following pages link to Some results on more flexible versions of Graph Motif (Q2354588):
Displaying 5 items.
- Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
- Finding approximate and constrained motifs in graphs (Q390871) (← links)
- The \textsc{Maximum Colorful Arborescence} problem: how (computationally) hard can it be? (Q2220833) (← links)
- Probably optimal graph motifs (Q2957868) (← links)
- (Q4897899) (← links)