The \(k\)-power domination problem in weighted trees
From MaRDI portal
Publication:2290632
DOI10.1016/j.tcs.2019.12.013zbMath1436.05107OpenAlexW2994757990MaRDI QIDQ2290632
Changjie Cheng, Yu Zhou, Chang-hong Lu
Publication date: 29 January 2020
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.12.013
Programming involving graphs or networks (90C35) Trees (05C05) Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22)
Related Items (4)
Labeling algorithm for power domination problem of trees ⋮ The restrained double Roman domination in graphs ⋮ 2-power domination number for Knödel graphs and its application in communication networks ⋮ Generalized power domination in claw-free regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized power domination of graphs
- The weighted perfect domination problem
- Improved algorithms and complexity results for power domination in graphs
- Domination in graphs with bounded propagation: Algorithms, formulations and hardness results
- On domination problems for permutation and other graphs
- A unified approach to domination problems on interval graphs
- Optimum domination in weighted trees
- Weighted connected domination and Steiner trees in distance-hereditary graphs
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
- Weighted independent perfect domination on cocomparability graphs
- A note on power domination in grid graphs
- WEIGHTED DOMINATION NUMBER OF CACTUS GRAPHS
- Power Domination in Product Graphs
- Domination in Graphs Applied to Electric Power Networks
- Computing and Combinatorics
- Approximation Algorithms and Hardness for Domination with Propagation
This page was built for publication: The \(k\)-power domination problem in weighted trees
