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 条
  • [31] A Fully Dynamic Graph Algorithm for Recognizing Proper Interval Graphs
    Ibarra, Louis
    WALCOM: ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5431 : 190 - 201
  • [32] Closed graphs are proper interval graphs
    Crupi, Marilena
    Rinaldo, Giancarlo
    ANALELE STIINTIFICE ALE UNIVERSITATII OVIDIUS CONSTANTA-SERIA MATEMATICA, 2014, 22 (03): : 37 - 44
  • [33] A fully dynamic algorithm for recognizing and representing proper interval graphs
    Hell, P
    Shamir, R
    Sharan, R
    SIAM JOURNAL ON COMPUTING, 2001, 31 (01) : 289 - 305
  • [34] A faster algorithm for the cluster editing problem on proper interval graphs
    Chih Lin, Min
    Soulignac, Francisco J.
    Szwarcfiter, Jayme L.
    INFORMATION PROCESSING LETTERS, 2015, 115 (12) : 913 - 916
  • [35] Graphs with equal secure total domination and inverse secure total domination numbers
    Kulli, V. R.
    Chaluvaraju, B.
    Kumara, M.
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2018, 39 (02): : 467 - 473
  • [36] Vertex covers and secure domination in graphs
    Burger, Alewyn P.
    Henning, Michael A.
    van Vuuren, Jan H.
    QUAESTIONES MATHEMATICAE, 2008, 31 (02) : 163 - 171
  • [37] On the Secure Total Domination Number of Graphs
    Cabrera Martinez, Abel
    Montejano, Luis P.
    Rodriguez-Velazquez, Juan A.
    SYMMETRY-BASEL, 2019, 11 (09):
  • [38] THE COMPLEXITY OF SECURE DOMINATION PROBLEM IN GRAPHS
    Wang, Haichao
    Zhao, Yancai
    Deng, Yunping
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2018, 38 (02) : 385 - 396
  • [39] Secure domination in rooted product graphs
    Hernandez-Ortiz, Rangel
    Montejano, Luis Pedro
    Rodriguez-Velazquez, Juan Alberto
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 41 (02) : 401 - 413
  • [40] SECURE POINT SET DOMINATION IN GRAPHS
    Gupta, Purnima
    Goyal, Alka
    TWMS JOURNAL OF APPLIED AND ENGINEERING MATHEMATICS, 2024, 14 (02): : 605 - 617
12345