A simple algorithm for secure domination in proper interval graphs

被引:8
|
作者
Zou, Y. H. [1 ]
Liu, J. J. [2 ]
Hsu, C. C. [1 ]
Wang, Y. L. [1 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Informat Management, Taipei, Taiwan
[2] Shih Hsin Univ, Dept Informat Management, 1 Lane 17 Sec 1,Mu Cha Rd, Taipei 10607, Taiwan
关键词
Secure domination; Domination; Proper interval graphs;
D O I
10.1016/j.dam.2019.01.012
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
In [Secure domination in proper interval graphs, Discrete Applied Mathematics 247 (2018) 70-76], Araki and Miyazaki proposed a linear-time algorithm for finding the secure domination number of proper interval graphs. However, the example they provided is exactly a counterexample. Based on their main idea, we propose a new simple algorithm for solving this problem in this paper. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:289 / 293
页数:5
相关论文
共 50 条