Pages that link to "Item:Q390871"
From MaRDI portal
The following pages link to Finding approximate and constrained motifs in graphs (Q390871):
Displaying 11 items.
- Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Searching and inferring colorful topological motifs in vertex-colored graphs (Q782751) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Algorithms for topology-free and alignment network queries (Q2250538) (← links)
- Some results on more flexible versions of Graph Motif (Q2354588) (← links)
- Fixed-parameter algorithms for scaffold filling (Q2513609) (← links)
- A uniform random graph model for directed acyclic networks and its effect on motif-finding (Q4689348) (← links)
- Engineering Motif Search for Large Graphs (Q5232527) (← links)
- Parallel Discovery of Top-k Weighted Motifs in Large Graphs (Q6487411) (← links)