Partial information network queries
From MaRDI portal
Publication:2018546
Recommendations
- Partial information network queries
- Improved parameterized algorithms for network query problems
- Improved parameterized algorithms for network query problems
- Algorithms for topology-free and alignment network queries
- Algorithms for regular tree grammar network search and their application to mining human-viral infection patterns
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Algorithm engineering for color-coding with applications to signaling pathway detection
- Algorithms for topology-free and alignment network queries
- Approximate labelled subtree homeomorphism
- Color-coding
- Constrained multilinear detection for faster functional motif discovery
- Faster Algebraic Algorithms for Path and Packing Problems
- Finding and counting vertex-colored subtrees
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Narrow sieves for parameterized paths and packings
- On the Kernelization Complexity of Colorful Motifs
- Parameterized algorithms for module motif
- Partial information network queries
- Probably optimal graph motifs
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- Some results on more flexible versions of Graph Motif
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
Cited in
(5)
This page was built for publication: Partial information network queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018546)