Pages that link to "Item:Q3011870"
From MaRDI portal
The following pages link to Finding Approximate and Constrained Motifs in Graphs (Q3011870):
Displayed 7 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Finding approximate and constrained motifs in graphs (Q390871) (← links)
- Constrained multilinear detection for faster functional motif discovery (Q456168) (← links)
- Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
- Some results on more flexible versions of Graph Motif (Q2354588) (← links)
- Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)