Pages that link to "Item:Q533412"
From MaRDI portal
The following pages link to Complexity issues in vertex-colored graph pattern matching (Q533412):
Displaying 7 items.
- Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
- Finding approximate and constrained motifs in graphs (Q390871) (← links)
- Constrained multilinear detection for faster functional motif discovery (Q456168) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- Searching and inferring colorful topological motifs in vertex-colored graphs (Q782751) (← links)
- Binary jumbled pattern matching on trees and tree-like structures (Q893318) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
