Pages that link to "Item:Q3506940"
From MaRDI portal
The following pages link to Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940):
Displayed 15 items.
- Constrained multilinear detection and generalized graph motifs (Q262282) (← links)
- Confronting intractability via parameters (Q465686) (← 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)
- Algorithms for topology-free and alignment network queries (Q2250538) (← links)
- The parameterised complexity of counting connected subgraphs and graph motifs (Q2256721) (← links)
- Some results on more flexible versions of Graph Motif (Q2354588) (← links)
- Improved parameterized algorithms for network query problems (Q2414861) (← links)
- Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
- Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
- Finding Approximate and Constrained Motifs in Graphs (Q3011870) (← links)
- Deterministic Subgraph Detection in Broadcast CONGEST. (Q3300802) (← links)
- Maximum Motif Problem in Vertex-Colored Graphs (Q3637115) (← links)
- (Q5140739) (← links)