Power domination with bounded time constraints
From MaRDI portal
Recommendations
Cites work
- A note on power domination in grid graphs
- A survey of gossiping and broadcasting in communication networks
- A threshold of ln n for approximating set cover
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
- Approximation Algorithms and Hardness for Domination with Propagation
- Computing and Combinatorics
- Domination in Graphs Applied to Electric Power Networks
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Generalized power domination in regular graphs
- Generalized power domination of graphs
- scientific article; zbMATH DE number 5138348 (Why is no real title available?)
- scientific article; zbMATH DE number 1302196 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- Improved algorithms and complexity results for power domination in graphs
- On the power domination number of the generalized Petersen graphs
- Parameterized power domination complexity
- Power domination in block graphs
- Power domination in circular-arc graphs
- Power domination in graphs
- Power domination in planar graphs with small diameter
- Power Domination in Product Graphs
- Spreading Messages
- The PMU Placement Problem
Cited in
(14)- Note on power propagation time and lower bounds for the power domination number
- On 2-rainbow domination of generalized Petersen graphs
- Grundy dominating sequences and zero forcing sets
- On a conjecture for power domination
- Power domination throttling
- Restricted power domination and zero forcing problems
- Connected power domination in graphs
- Power domination in block graphs
- Throttling processes equivalent to full throttling on trees
- Algorithms and complexity of power domination in graphs
- Power domination in graphs
- Zero forcing and power domination for graph products
- Power domination on triangular grids with triangular and hexagonal shape
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
This page was built for publication: Power domination with bounded time constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963647)
