Abstract | ||
---|---|---|
•We solved the k-power domination problem in weighted trees and obtain the k-power domination number in linear time. |
Year | DOI | Venue |
---|---|---|
2020 | 10.1016/j.tcs.2019.12.013 | Theoretical Computer Science |
Keywords | Field | DocType |
Power domination,Weighted trees,Linear time algorithm,Dynamic programming | Dynamic programming,Discrete mathematics,Graph,Units of measurement,Electric power system,Mathematics | Journal |
Volume | ISSN | Citations |
809 | 0304-3975 | 1 |
PageRank | References | Authors |
0.35 | 0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
ChangJie Cheng | 1 | 1 | 0.35 |
Changhong Lu | 2 | 1 | 0.35 |
Yu Zhou | 3 | 378 | 66.97 |