The k-power domination problem in weighted trees

Changjie Cheng; Changhong Lu; Yu Zhou

doi:10.1016/j.tcs.2019.12.013

The k-power domination problem in weighted trees

Changjie Cheng
, Changhong Lu^*
, Yu Zhou

^*Corresponding author for this work

School of Mathematical Sciences

East China Normal University

Research output: Contribution to journal › Article › peer-review

5 Scopus citations

Abstract

The power domination problem of the graph comes from how to choose the node location of the least phase measurement units in the electric power system. In the actual electric power system, because of the difference in the cost of phase measurement units at different nodes, it is more practical to study the power domination problem with the weighted graph. In this paper, we present a dynamic programming style linear-time algorithm for k-power domination problem in weighted trees.

Original language	English
Pages (from-to)	231-238
Number of pages	8
Journal	Theoretical Computer Science
Volume	809
DOIs	https://doi.org/10.1016/j.tcs.2019.12.013
State	Published - 24 Feb 2020

Keywords

Dynamic programming
Linear time algorithm
Power domination
Weighted trees

Access to Document

10.1016/j.tcs.2019.12.013

Cite this

@article{530393101d2c4b9d83bdbb3fecc51b65,

title = "The k-power domination problem in weighted trees",

abstract = "The power domination problem of the graph comes from how to choose the node location of the least phase measurement units in the electric power system. In the actual electric power system, because of the difference in the cost of phase measurement units at different nodes, it is more practical to study the power domination problem with the weighted graph. In this paper, we present a dynamic programming style linear-time algorithm for k-power domination problem in weighted trees.",

keywords = "Dynamic programming, Linear time algorithm, Power domination, Weighted trees",

author = "Changjie Cheng and Changhong Lu and Yu Zhou",

note = "Publisher Copyright: {\textcopyright} 2019 Elsevier B.V.",

year = "2020",

month = feb,

day = "24",

doi = "10.1016/j.tcs.2019.12.013",

language = "英语",

volume = "809",

pages = "231--238",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - The k-power domination problem in weighted trees

AU - Cheng, Changjie

AU - Lu, Changhong

AU - Zhou, Yu

PY - 2020/2/24

Y1 - 2020/2/24

N2 - The power domination problem of the graph comes from how to choose the node location of the least phase measurement units in the electric power system. In the actual electric power system, because of the difference in the cost of phase measurement units at different nodes, it is more practical to study the power domination problem with the weighted graph. In this paper, we present a dynamic programming style linear-time algorithm for k-power domination problem in weighted trees.

AB - The power domination problem of the graph comes from how to choose the node location of the least phase measurement units in the electric power system. In the actual electric power system, because of the difference in the cost of phase measurement units at different nodes, it is more practical to study the power domination problem with the weighted graph. In this paper, we present a dynamic programming style linear-time algorithm for k-power domination problem in weighted trees.

KW - Dynamic programming

KW - Linear time algorithm

KW - Power domination

KW - Weighted trees

UR - https://www.scopus.com/pages/publications/85077155689

U2 - 10.1016/j.tcs.2019.12.013

DO - 10.1016/j.tcs.2019.12.013

M3 - 文章

AN - SCOPUS:85077155689

SN - 0304-3975

VL - 809

SP - 231

EP - 238

JO - Theoretical Computer Science

JF - Theoretical Computer Science

ER -

The k-power domination problem in weighted trees

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this