Constrained multilinear detection for faster functional motif discovery
From MaRDI portal
Publication:456168
DOI10.1016/j.ipl.2012.08.008zbMath1248.68583arXiv1206.3483OpenAlexW2013902279MaRDI QIDQ456168
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.3483
Analysis of algorithms (68W40) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)
Related Items (15)
Deterministic parameterized algorithms for the graph motif problem ⋮ Parameterized algorithms for the module motif problem ⋮ The graph motif problem parameterized by the structure of the input graph ⋮ Approximately Counting and Sampling Small Witnesses Using a Colorful Decision Oracle ⋮ Improved Parameterized Algorithms for Network Query Problems ⋮ Improved parameterized algorithms for network query problems ⋮ Unnamed Item ⋮ Algorithms for topology-free and alignment network queries ⋮ Exact exponential algorithms to find tropical connected sets of minimum size ⋮ Partial information network queries ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Univariate ideal membership parameterized by rank, degree, and number of generators ⋮ Some results on more flexible versions of Graph Motif ⋮ Constrained multilinear detection and generalized graph motifs
Cites Work
- Complexity issues in vertex-colored graph pattern matching
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time
- Finding Approximate and Constrained Motifs in Graphs
- Faster Algebraic Algorithms for Path and Packing Problems
- Finding and Counting Vertex-Colored Subtrees
- Limits and Applications of Group Algebras for Parameterized Problems
This page was built for publication: Constrained multilinear detection for faster functional motif discovery
