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
来源：
DISCRETE APPLIED MATHEMATICS | 2019年 / 260卷
关键词：
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 条
  • [21] Secure total domination in graphs
    Benecke, S.
    Cockayne, E. J.
    Mynhardt, C. M.
    UTILITAS MATHEMATICA, 2007, 74 : 247 - 259
  • [22] SECURE DOMINATION IN MYCEILSKI GRAPHS
    Mercy, J. Annaal
    Raj, L. Benedict Michael
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2023, 13 : 539 - 545
  • [23] Secure Restrained Domination in Graphs
    Pushpam P.R.L.
    Suseendran C.
    Mathematics in Computer Science, 2015, 9 (2) : 239 - 247
  • [24] New algorithms for weighted k-domination and total k-domination problems in proper interval graphs
    Chiarelli, Nina
    Romina Hartinger, Tatiana
    Alejandra Leoni, Valeria
    Lopez Pujato, Maria Ines
    Milanic, Martin
    THEORETICAL COMPUTER SCIENCE, 2019, 795 : 128 - 141
  • [25] Co-Secure and Secure Domination in Graphs
    Arumugam, S.
    Ebadi, Karam
    Manrique, Martin
    UTILITAS MATHEMATICA, 2014, 94 : 167 - 182
  • [26] Separator Theorems for Interval Graphs and Proper Interval Graphs
    Panda, B. S.
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS (CALDAM 2015), 2015, 8959 : 101 - 110
  • [27] The algorithm and complexity of secure domination in 3-dimensional box graphs
    Wang, Cai-Xia
    Yang, Yu
    Xu, Shou-Jun
    Discrete Applied Mathematics, 366 : 63 - 74
  • [28] The algorithm and complexity of co-secure domination in geometric intersection graphs
    Wang, Cai-Xia
    Yang, Yu
    Xu, Shou-Jun
    COMPUTATIONAL & APPLIED MATHEMATICS, 2025, 44 (01):
  • [29] The algorithm and complexity of secure domination in 3-dimensional box graphs
    Wang, Cai-Xia
    Yang, Yu
    Xu, Shou-Jun
    DISCRETE APPLIED MATHEMATICS, 2025, 366 : 63 - 74
  • [30] A fully dynamic algorithm for recognizing and representing proper interval graphs
    Hell, P
    Shamir, R
    Sharan, R
    ALGORITHMS - ESA'99, 1999, 1643 : 527 - 539
12345