论文标题
纠正JHA，Pradhan和Banerjee的Cographs的安全统治数量的算法
Correcting the algorithm for the secure domination number of cographs by Jha, Pradhan, and Banerjee
论文作者
论文摘要
Jha，Pradhan和Banerjee设计了一种线性算法来计算Cograph的安全统治数。这里表明，它们的引理〜2对算法的计算复杂性至关重要，这是不完整的。证明了相应的修饰引理，并证明修饰算法的复杂性保持线性。
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.
