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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics Jg. 334; S. 139 - 144
Hauptverfasser: Araki, Toru, Saito, Ryuya
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 31.07.2023
Schlagworte:
Domination
Linear time algorithm
Proper interval graphs
Secure domination
Domination
Linear time algorithm
Proper interval graphs
Secure domination
ISSN:0166-218X, 1872-6771
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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