Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees

DOI10.1007/978-3-540-92182-0_15zbMath1183.68435MaRDI QIDQ3596713

Henning Fernau, Daniel Raible

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92182-0_15

Mathematics Subject Classification ID

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)

68P05: Data structures