Pages that link to "Item:Q5363785"
From MaRDI portal
The following pages link to The Graph Motif Problem Parameterized by the Structure of the Input Graph (Q5363785):
Displaying 10 items.
- Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Constrained multilinear detection for faster functional motif discovery (Q456168) (← links)
- Finding and counting vertex-colored subtrees (Q1949738) (← links)
- Some results on more flexible versions of Graph Motif (Q2354588) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- Parameterized edge Hamiltonicity (Q2413968) (← links)
- On Structural Parameterizations of Graph Motif and Chromatic Number (Q2971640) (← links)
- Integer Programming in Parameterized Complexity: Three Miniatures. (Q5009484) (← links)
- Graph Motif Problems Parameterized by Dual (Q5119384) (← links)