Labeling algorithm for power domination problem of trees
•The algorithm proposed in this paper is simpler and easier to understand compared to the algorithms in references [3] and [8].•The paper focuses on the power domination problem on trees and presents a linear-time algorithm to solve it using the labeling method. In this paper, the power domination p...
Saved in:
| Published in: | Applied mathematics and computation Vol. 457; p. 128163 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
15.11.2023
|
| Subjects: | |
| ISSN: | 0096-3003 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | •The algorithm proposed in this paper is simpler and easier to understand compared to the algorithms in references [3] and [8].•The paper focuses on the power domination problem on trees and presents a linear-time algorithm to solve it using the labeling method.
In this paper, the power domination problem on trees is studied and we give a linear-time algorithm to it by using the labeling method. Our algorithm is simpler and easier to understand than those in [3,7]. |
|---|---|
| ISSN: | 0096-3003 |
| DOI: | 10.1016/j.amc.2023.128163 |