论文信息 - A simple algorithm for secure domination in proper interval graphs

A simple algorithm for secure domination in proper interval graphs

Abstract 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.

[1] S. Olariu,et al. Optimal greedy algorithms for indifference graphs , 1992, Proceedings IEEE Southeastcon '92.

[2] Toru Araki,et al. Secure domination in proper interval graphs , 2018, Discret. Appl. Math..

[3] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..