Pages that link to "Item:Q390871"
From MaRDI portal
The following pages link to Finding approximate and constrained motifs in graphs (Q390871):
Displaying 5 items.
- Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
- Exact exponential algorithms to find tropical connected sets of minimum size (Q527400) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Algorithms for topology-free and alignment network queries (Q2250538) (← links)
- Fixed-parameter algorithms for scaffold filling (Q2513609) (← links)
