Deterministic Parameterized Algorithms for the Graph Motif Problem

DOI10.1007/978-3-662-44465-8_50zbMath1405.05177MaRDI 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

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms