Pages that link to "Item:Q3586101"
From MaRDI portal
The following pages link to Finding and Counting Vertex-Colored Subtrees (Q3586101):
Displaying 7 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- On the parameterized complexity of the repetition free longest common subsequence problem (Q413298) (← links)
- Constrained multilinear detection for faster functional motif discovery (Q456168) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Finding and counting vertex-colored subtrees (Q1949738) (← links)
- Finding Approximate and Constrained Motifs in Graphs (Q3011870) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
