Algorithms and Complexity of Power Domination in Graphs
From MaRDI portal
Publication:3384121
DOI10.1007/978-3-030-58892-2_15zbMath1479.05275OpenAlexW3158818916MaRDI QIDQ3384121
Stephen T. Hedetniemi, Alice A. McRae, Raghuveer Mohan
Publication date: 14 December 2021
Published in: Developments in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-58892-2_15
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized power domination of graphs
- Power domination in certain chemical structures
- Restricted power domination and fault-tolerant power domination on grids
- Parameterized power domination complexity
- On the \({k}\)-power domination of hypergraphs
- Improved algorithms and complexity results for power domination in graphs
- Minimum rank of skew-symmetric matrices described by a graph
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- A linear algorithm for the domination number of a tree
- Linear algorithms on recursive representations of trees
- Power domination in circular-arc graphs
- Restricted power domination and zero forcing problems
- Connected power domination in graphs
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}
- Zero forcing sets and the minimum rank of graphs
- A note on power domination in grid graphs
- Power domination in graphs
- Power domination in block graphs
- Generalized Power Domination in Regular Graphs
- Power domination in cylinders, tori, and generalized Petersen graphs
- A threshold of ln n for approximating set cover
- Power Domination in Graphs
- Power Domination in $\mathcal{O}^*(1.7548^n)$ Using Reference Search Trees
- Power Domination in Product Graphs
- Power domination in honeycomb networks
- Domination in Graphs Applied to Electric Power Networks
- Minimum Power Dominating Sets of Random Cubic Graphs
- The PMU Placement Problem
- Fundamentals of Computation Theory
- Computing and Combinatorics
- Approximation Algorithms and Hardness for Domination with Propagation
- Approximation Algorithms and Hardness for Domination with Propagation
- Power domination with bounded time constraints
- \(k\)-power domination in block graphs
This page was built for publication: Algorithms and Complexity of Power Domination in Graphs
