Correcting the algorithm for a minimum secure dominating set of proper interval graphs by Zou, Liu, Hsu and Wang

Zou et al. (2019) proposed an algorithm for calculating a minimum secure dominating set of a proper interval graph. However, we find a counterexample for which the algorithm outputs an incorrect subset of vertices. In this paper, we provide a modified algorithm and the proofs for the correctness.

Uloženo v:
Podrobná bibliografie
Vydáno v:Discrete Applied Mathematics Ročník 334; s. 139 - 144
Hlavní autoři: Araki, Toru, Saito, Ryuya
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 31.07.2023
Témata:
Domination
Linear time algorithm
Proper interval graphs
Secure domination
Domination
Linear time algorithm
Proper interval graphs
Secure domination
ISSN:0166-218X, 1872-6771
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í:Zou et al. (2019) proposed an algorithm for calculating a minimum secure dominating set of a proper interval graph. However, we find a counterexample for which the algorithm outputs an incorrect subset of vertices. In this paper, we provide a modified algorithm and the proofs for the correctness.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2023.04.002