Partial information network queries
From MaRDI portal
Publication:2018546
DOI10.1016/j.jda.2014.11.007zbMath1322.68258OpenAlexW2062190215MaRDI QIDQ2018546
Meirav Zehavi, Hadas Shachnai, Ron Yair Pinter
Publication date: 24 March 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2014.11.007
pattern matchingparameterized algorithmalignment network querypartial information network querytopology-free network query
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20) Systems biology, networks (92C42)
Related Items (1)
Uses Software
Cites Work
- Constrained multilinear detection for faster functional motif discovery
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Algorithm engineering for color-coding with applications to signaling pathway detection
- Approximate labelled subtree homeomorphism
- Finding and counting vertex-colored subtrees
- Algorithms for topology-free and alignment network queries
- Narrow sieves for parameterized paths and packings
- Parameterized Algorithms for Module Motif
- Partial Information Network Queries
- Some Results on more Flexible Versions of Graph Motif
- Probably optimal graph motifs
- On the Kernelization Complexity of Colorful Motifs
- Faster Algebraic Algorithms for Path and Packing Problems
- Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
- Color-coding
- Unnamed Item
- Unnamed Item
This page was built for publication: Partial information network queries
