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

DOI10.1007/978-3-540-92182-0_15MaRDI QIDQ3596713zbMATH OpenOpenAlexFDO

Authors Daniel Raible, Henning Fernau

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

Recommendations

• An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
• Improved algorithms and complexity results for power domination in graphs
• Fundamentals of Computation Theory
• Generalized power domination of graphs
• Approximation Algorithms and Hardness for Domination with Propagation

Cited in

(4)

• 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
• Improved algorithms and complexity results for power domination in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596713)