Pages that link to "Item:Q3637115"
From MaRDI portal
The following pages link to Maximum Motif Problem in Vertex-Colored Graphs (Q3637115):
Displayed 8 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Finding and counting vertex-colored subtrees (Q1949738) (← links)
- Complexity and inapproximability results for balanced connected subgraph problem (Q2232593) (← links)
- The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
- Finding Approximate and Constrained Motifs in Graphs (Q3011870) (← links)
- (Q5140739) (← links)