Fundamentals of Computation Theory

DOI10.1007/11537311zbMath1122.68481OpenAlexW2491671784MaRDI QIDQ5492926

Rolf Niedermeier, Jiong Guo, Daniel Raible

Publication date: 20 October 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11537311

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (15)

Augmenting weighted graphs to establish directed point-to-point connectivity ⋮ Power domination number of sunlet graph and other graphs ⋮ Experiments on data reduction for optimal domination in networks ⋮ Power domination in the generalized Petersen graphs ⋮ Power domination in Mycielskian of spiders ⋮ Connected power domination in graphs ⋮ A cutting-plane algorithm for solving a weighted influence interdiction problem ⋮ Generalized power domination of graphs ⋮ Power domination in certain chemical structures ⋮ Tree decompositions of graphs: saving memory in dynamic programming ⋮ Complexity and inapproximability results for the power edge set problem ⋮ Domination in graphs with bounded propagation: Algorithms, formulations and hardness results ⋮ On the power domination number of the generalized Petersen graphs ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Disproofs of three conjectures on the power domination of graphs

This page was built for publication: Fundamentals of Computation Theory