A strengthened analysis of an algorithm for DOMINATING SET in planar graphs

被引：0
|
作者：
Hagerup, Torben [1 ]
机构：
[1] Univ Augsburg, Inst Informat, D-86135 Augsburg, Germany
来源：
DISCRETE APPLIED MATHEMATICS | 2012年 / 160卷 / 06期
关键词：
Dominating set; Planar graph; Parameterized complexity; PARAMETERIZED ALGORITHMS;
D O I：
10.1016/j.dam.2010.10.004
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Alber et al. presented an algorithm for computing a dominating set of size at most k, if one exists, in an undirected planar n-vertex graph and bounded its execution time by O(8(k)0). Here it is shown that the algorithm performs better than claimed by its authors. More significantly, if k <= n/19, even a much simplified version of the algorithm runs in O(7(k)n) time. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：793 / 798
页数：6
相关论文
共 50 条
  • [31] NP-Completeness of the Independent Dominating Set Problem in the Class of Cubic Planar Bipartite Graphs
    Loverov Y.A.
    Orlovich Y.L.
    Journal of Applied and Industrial Mathematics, 2020, 14 (02): : 353 - 368
  • [32] On the Number of -Dominating Independent Sets in Planar Graphs
    Taletskii D.S.
    Journal of Applied and Industrial Mathematics, 2024, 18 (01) : 167 - 178
  • [33] On dominating sets of maximal outerplanar and planar graphs
    Li, Zepeng
    Zhu, Enqiang
    Shao, Zehui
    Xu, Jin
    Discrete Applied Mathematics, 2016, 198 : 164 - 169
  • [34] On dominating sets of maximal outerplanar and planar graphs
    Li, Zepeng
    Zhu, Enqiang
    Shao, Zehui
    Xu, Jin
    DISCRETE APPLIED MATHEMATICS, 2016, 198 : 164 - 169
  • [35] New analysis and computational study for the planar connected dominating set problem
    Marzban, Marjan
    Gu, Qian-Ping
    Jia, Xiaohua
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 32 (01) : 198 - 225
  • [36] New analysis and computational study for the planar connected dominating set problem
    Marjan Marzban
    Qian-Ping Gu
    Xiaohua Jia
    Journal of Combinatorial Optimization, 2016, 32 : 198 - 225
  • [37] AN APPROXIMATION ALGORITHM FOR THE MAXIMUM INDEPENDENT SET PROBLEM ON PLANAR GRAPHS
    CHIBA, N
    NISHIZEKI, T
    SAITO, N
    SIAM JOURNAL ON COMPUTING, 1982, 11 (04) : 663 - 675
  • [38] On resolving total dominating set of sunlet graphs
    Ervani, R. S. R.
    Dafik
    Tirta, I. M.
    Alfarisi, R.
    Adawiyah, R.
    2ND INTERNATIONAL CONFERENCE ON PHYSICS AND MATHEMATICS FOR BIOLOGICAL SCIENCE (2ND ICOPAMBS) 2020, 2021, 1832
  • [39] Closed neutrosophic dominating set in neutrosophic graphs
    Majeed A.
    Arif N.
    Neutrosophic Sets and Systems, 2023, 55 : 510 - 528
  • [40] On dominating set polyhedra of circular interval graphs
    Bianchi, Silvia
    Nasini, Graciela
    Tolomei, Paola
    Miguel Torres, Luis
    DISCRETE MATHEMATICS, 2021, 344 (04)
12345