Deterministic Parameterized Algorithms for the Graph Motif Problem

DOI10.1007/978-3-662-44465-8_50zbMath1405.05177OpenAlexW2115999873MaRDI QIDQ2922645

Meirav Zehavi, Hadas Shachnai, Ron Yair Pinter

Publication date: 14 October 2014

Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44465-8_50

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (5)

Fast Algorithms for Parameterized Problems with Relaxed Disjointness Constraints ⋮ Mixing Color Coding-Related Techniques ⋮ Parameterized algorithms for the module motif problem ⋮ The graph motif problem parameterized by the structure of the input graph ⋮ Representative families: a unified tradeoff-based approach

This page was built for publication: Deterministic Parameterized Algorithms for the Graph Motif Problem