Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
Combinatorics
2021-05-18 v2
Abstract
Jha, Pradhan, and Banerjee devised a linear algorithm to compute the secure domination number of a cograph. Here it is shown that their Lemma~2, which is crucial for the computational complexity of the algorithm, is incomplete. An accordingly modified lemma is proved and it is demonstrated that the complexity of the modified algorithm remains linear.
Keywords
Cite
@article{arxiv.2011.00522,
title = {Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee},
author = {Anja Kišek and Sandi Klavžar},
journal= {arXiv preprint arXiv:2011.00522},
year = {2021}
}