Pages that link to "Item:Q958201"
From MaRDI portal
The following pages link to Algorithm engineering for color-coding with applications to signaling pathway detection (Q958201):
Displaying 25 items.
- Parameterized algorithms for the module motif problem (Q342716) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Parameterized algorithms for list \(K\)-cycle (Q666679) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Maximum disjoint paths on edge-colored graphs: approximability and tractability (Q1736537) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Finding and counting vertex-colored subtrees (Q1949738) (← links)
- Partial information network queries (Q2018546) (← links)
- Algorithms for topology-free and alignment network queries (Q2250538) (← links)
- Faster deterministic parameterized algorithm for \(k\)-path (Q2272387) (← links)
- An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725) (← links)
- A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
- Improved parameterized algorithms for network query problems (Q2414861) (← links)
- Improved Parameterized Algorithms for Network Query Problems (Q2946028) (← links)
- A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems (Q3506940) (← links)
- Balanced Hashing, Color Coding and Approximate Counting (Q3656847) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- (Q5075790) (← links)
- On the Descriptive Complexity of Color Coding (Q5090457) (← links)
- Approximate Counting of k-Paths: Deterministic and in Polynomial Space (Q5091173) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- The \(k\)-distinct language: parameterized automata constructions (Q5964071) (← links)
- Detours in directed graphs (Q6113279) (← links)
