Pages that link to "Item:Q2250538"
From MaRDI portal
The following pages link to Algorithms for topology-free and alignment network queries (Q2250538):
Displaying 14 items.
- Deterministic parameterized algorithms for the graph motif problem (Q313814) (← links)
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Searching and inferring colorful topological motifs in vertex-colored graphs (Q782751) (← links)
- Partial information network queries (Q2018546) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- Improved parameterized algorithms for network query problems (Q2414861) (← links)
- Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
- Directed Graph Pattern Matching and Topological Embedding (Q3128193) (← links)
- Quasipolynomial representation of transversal matroids with applications in parameterized complexity (Q4993296) (← links)
- Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
- (Q5140739) (← links)
- Efficient lookup on unstructured topologies (Q5177227) (← links)