Parameterized algorithms for the module motif problem
From MaRDI portal
Publication:342716
DOI10.1016/j.ic.2016.08.005zbMath1353.68141OpenAlexW2512562110MaRDI QIDQ342716
Publication date: 18 November 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2016.08.005
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Systems biology, networks (92C42)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- Constrained multilinear detection for faster functional motif discovery
- Upper and lower bounds for finding connected motifs in vertex-colored graphs
- Algorithm engineering for color-coding with applications to signaling pathway detection
- On problems without polynomial kernels
- Partitive hypergraphs
- A probabilistic remark on algebraic program testing
- 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
- Deterministic Parameterized Algorithms for the Graph Motif Problem
- An in-place truncated fourier transform and applications to polynomial multiplication
- Probably optimal graph motifs
- Finding Approximate and Constrained Motifs in Graphs
- On the Kernelization Complexity of Colorful Motifs
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
This page was built for publication: Parameterized algorithms for the module motif problem
