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

DOI10.1007/978-3-540-92182-0_15zbMath1183.68435OpenAlexW2211439443MaRDI 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

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)

Related Items (3)

Power domination in circular-arc graphs ⋮ An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} ⋮ Algorithms and Complexity of Power Domination in Graphs

This page was built for publication: Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees