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 条
  • [41] Neutrosophic special dominating set in neutrosophic graphs
    Banitalebi, Sadegh
    Borzooei, Rajab Ali
    Neutrosophic Sets and Systems, 2021, 45 : 26 - 39
  • [42] Approximating Edge Dominating Set in Dense Graphs
    Schmied, Richard
    Viehmann, Claus
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 37 - 47
  • [43] The complexity of Dominating Set in geometric intersection graphs
    de Berg, Mark
    Kisfaludi-Bak, Sandor
    Woeginger, Gerhard
    THEORETICAL COMPUTER SCIENCE, 2019, 769 : 18 - 31
  • [44] Maximum graphs with a unique minimum dominating set
    Fischermann, M
    Rautenbach, D
    Volkmann, L
    DISCRETE MATHEMATICS, 2003, 260 (1-3) : 197 - 203
  • [45] The eternal dominating set problem for interval graphs
    Rinemberg, Martin
    Soulignac, Francisco J.
    INFORMATION PROCESSING LETTERS, 2019, 146 : 27 - 29
  • [46] On the complexity of Dominating Set for graphs with fixed diameter
    Bouquet, Valentin
    Delbot, Francois
    Picouleau, Christophe
    Rovedakis, Stephane
    THEORETICAL COMPUTER SCIENCE, 2024, 1001
  • [47] Approximating edge dominating set in dense graphs
    Schmied, Richard
    Viehmann, Claus
    THEORETICAL COMPUTER SCIENCE, 2012, 414 (01) : 92 - 99
  • [48] On the complexity of independent dominating set with obligations in graphs
    Laforest, Christian
    Martinod, Timothee
    THEORETICAL COMPUTER SCIENCE, 2022, 904 : 1 - 14
  • [49] Parameterized Edge Dominating Set in Cubic Graphs
    Xiao, Mingyu
    Nagamochi, Hiroshi
    FRONTIERS IN ALGORITHMICS AND ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, (FAW-AAIM 2011), 2011, 6681 : 100 - 112
  • [50] Linear Kernel for Planar Connected Dominating Set
    Lokshtanov, Daniel
    Mnich, Matthias
    Saurabh, Saket
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 281 - +
12345