Power domination throttling
From MaRDI portal
Publication:2330105
DOI10.1016/j.tcs.2019.06.008zbMath1431.68044arXiv1810.01009OpenAlexW2955168228WikidataQ127565656 ScholiaQ127565656MaRDI QIDQ2330105
Illya V. Hicks, Joshua Carlson, Rutvik Patel, Boris Brimkov, Logan Smith
Publication date: 18 October 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.01009
Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (5)
Throttling for Zero Forcing and Variants ⋮ Various characterizations of throttling numbers ⋮ Throttling for standard zero forcing on directed graphs ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propagation time for zero forcing on a graph
- Zero forcing propagation time on oriented graphs
- Throttling for the game of cops and robbers on graphs
- Parameterized power domination complexity
- Positive semidefinite propagation time
- Improved algorithms and complexity results for power domination in graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- Computational approaches for zero forcing and related problems
- Note on power propagation time and lower bounds for the power domination number
- Throttling positive semidefinite zero forcing propagation time on graphs
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time
- Complexity and computation of connected zero forcing
- Generalized power domination: propagation radius and Sierpiński graphs
- Restricted power domination and zero forcing problems
- Connected power domination in graphs
- A note on power domination in grid graphs
- Power domination in graphs
- Power domination in block graphs
- Positive Semidefinite Zero Forcing: Complexity and Lower Bounds
- Power Domination in Product Graphs
- Domination in Graphs Applied to Electric Power Networks
- Throttling for Zero Forcing and Variants
- The PMU Placement Problem
- Computing and Combinatorics
- On the complexity of the positive semidefinite zero forcing number
- Power domination with bounded time constraints
This page was built for publication: Power domination throttling
