Deterministic parameterized algorithms for the graph motif problem

DOI10.1016/j.dam.2016.04.026zbMath1344.05136OpenAlexW2374995892MaRDI QIDQ313814

Hadas Shachnai, Meirav Zehavi, Ron Yair Pinter

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2016.04.026

zbMATH Keywords

graph motifguiding treeparameterized algorithmrepresentative family

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (4)

Unnamed Item ⋮ Graph Motif Problems Parameterized by Dual ⋮ Unnamed Item ⋮ Searching and inferring colorful topological motifs in vertex-colored graphs

Cites Work

• Unnamed Item
• Finding approximate and constrained motifs in graphs
• Constrained multilinear detection for faster functional motif discovery
• Complexity issues in vertex-colored graph pattern matching
• Upper and lower bounds for finding connected motifs in vertex-colored graphs
• Finding and counting vertex-colored subtrees
• Partial information network queries
• Algorithms for topology-free and alignment network queries
• Some results on more flexible versions of Graph Motif
• Narrow sieves for parameterized paths and packings
• Representative Sets of Product Families
• Representative Families: A Unified Tradeoff-Based Approach
• On the Kernelization Complexity of Colorful Motifs
• Deterministic Truncation of Linear Matroids
• Color-coding
• Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
• Multiplying matrices faster than coppersmith-winograd

This page was built for publication: Deterministic parameterized algorithms for the graph motif problem