Pages that link to "Item:Q533412"
From MaRDI portal
The following pages link to Complexity issues in vertex-colored graph pattern matching (Q533412):
Displayed 5 items.
- Finding approximate and constrained motifs in graphs (Q390871) (← links)
- Constrained multilinear detection for faster functional motif discovery (Q456168) (← links)
- Algorithms for topology-free and alignment network queries (Q2250538) (← links)
- Some results on more flexible versions of Graph Motif (Q2354588) (← links)
- Fixed-parameter algorithms for scaffold filling (Q2513609) (← links)