Improved Parameterized Algorithms for Network Query Problems
From MaRDI portal
Publication:2946028
DOI10.1007/978-3-319-13524-3_25zbMath1456.68133OpenAlexW284561269MaRDI QIDQ2946028
Meirav Zehavi, Hadas Shachnai, Ron Yair Pinter
Publication date: 15 September 2015
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.587.6778
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Faster algorithms for finding and counting subgraphs
- Constrained multilinear detection for faster functional motif discovery
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- FPT algorithms for connected feedback vertex set
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Algorithm engineering for color-coding with applications to signaling pathway detection
- Finding and counting vertex-colored subtrees
- Algorithms for topology-free and alignment network queries
- Partial Information Network Queries
- Probably optimal graph motifs
- Finding Approximate and Constrained Motifs in Graphs
- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems
- Faster Algebraic Algorithms for Path and Packing Problems
- Limits and Applications of Group Algebras for Parameterized Problems
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Color-coding
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
This page was built for publication: Improved Parameterized Algorithms for Network Query Problems
