An efficient algorithm for power dominating set

DOI10.1007/S00453-024-01283-8MaRDI QIDQ7022272zbMATH OpenFDO

Authors Thomas Bläsius, Max Göttlicher

Publication date 25 February 2025

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

parameterized complexityimplicit hitting setreduction rulespower dominating set

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: An efficient algorithm for power dominating set

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