Power domination with bounded time constraints

DOI10.1007/S10878-014-9785-2zbMath1342.90167OpenAlexW2077014186MaRDI QIDQ5963647

Chung-Shou Liao

Publication date: 23 February 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-014-9785-2

zbMATH Keywords

algorithmdominationpower dominationtime constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (12)

Throttling processes equivalent to full throttling on trees ⋮ Note on power propagation time and lower bounds for the power domination number ⋮ Restricted power domination and zero forcing problems ⋮ Connected power domination in graphs ⋮ On 2-rainbow domination of generalized Petersen graphs ⋮ Grundy dominating sequences and zero forcing sets ⋮ On a conjecture for power domination ⋮ Unnamed Item ⋮ Algorithms and Complexity of Power Domination in Graphs ⋮ Power Domination in Graphs ⋮ Power domination on triangular grids with triangular and hexagonal shape ⋮ Power domination throttling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized power domination of graphs
• On the power domination number of the generalized Petersen graphs
• Parameterized power domination complexity
• Improved algorithms and complexity results for power domination in graphs
• Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
• Power domination in circular-arc graphs
• An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
• A note on power domination in grid graphs
• Power domination in graphs
• Power domination in block graphs
• Generalized Power Domination in Regular Graphs
• A threshold of ln n for approximating set cover
• Spreading Messages
• Power Domination in Product Graphs
• A survey of gossiping and broadcasting in communication networks
• Domination in Graphs Applied to Electric Power Networks
• Power domination in planar graphs with small diameter
• The PMU Placement Problem
• Computing and Combinatorics
• Approximation Algorithms and Hardness for Domination with Propagation

This page was built for publication: Power domination with bounded time constraints