Parameterized Algorithms and Hardness Results for Some Graph Motif Problems

DOI10.1007/978-3-540-69068-9_6zbMath1143.68501WikidataQ57359911 ScholiaQ57359911MaRDI QIDQ3506940

Michael R. Fellows, Rolf Niedermeier, Christian Komusiewicz, Nadja Betzler

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: http://espace.cdu.edu.au/view/cdu:9643

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W20: Randomized algorithms