正确性
数学
反例
数学证明
支配集
区间(图论)
算法
组合数学
图形
集合(抽象数据类型)
离散数学
计算机科学
顶点(图论)
几何学
程序设计语言
作者
Toru Araki,Ryuya Saito
标识
DOI:10.1016/j.dam.2023.04.002
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI