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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied mathematics and computation Ročník 457; s. 128163
Hlavní autor: Lyu, Yijia
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 15.11.2023
Témata:
Dominating set
Linear-time algorithm
Power domination
Trees
Trees
Power domination
Dominating set
05C85
05C05
Linear-time algorithm
ISSN:0096-3003
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•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