A linear kernel for a planar connected dominating set

被引：14
|
作者：
Lokshtanov, Daniel [2 ]
Mnich, Matthias [3 ]
Saurabh, Saket [1 ]
机构：
[1] Inst Math Sci, Madras 600113, Tamil Nadu, India
[2] Univ Bergen, Inst Informat, N-5020 Bergen, Norway
[3] Tech Univ Eindhoven, Fac Wiskunde Informat, NL-5600 MB Eindhoven, Netherlands
来源：
THEORETICAL COMPUTER SCIENCE | 2011年 / 412卷 / 23期
关键词：
Connected dominating set; Kernelization; Planar graphs; Reduce or refine; KERNELIZATION; ALGORITHMS; FASTER;
D O I：
10.1016/j.tcs.2010.10.045
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We provide polynomial time data reduction rules for CONNECTED DOMINATING SET on planar graphs and analyze these to obtain a linear kernel for the planar CONNECTED DOMINATING SET problem. To obtain the desired kernel we introduce a method that we call reduce or refine. Our kernelization algorithm analyzes the input graph and either finds an appropriate reduction rule that can be applied, or zooms in on a region of the graph which is more amenable to reduction. We find this method of independent interest and believe that it will be useful for obtaining linear kernels for other problems on planar graphs. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：2536 / 2543
页数：8
相关论文
共 50 条
  • [1] Linear Kernel for Planar Connected Dominating Set
    Lokshtanov, Daniel
    Mnich, Matthias
    Saurabh, Saket
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, 2009, 5532 : 281 - +
  • [2] Improved linear problem kernel for planar connected dominating set
    Luo, Weizhong
    Wang, Jianxin
    Feng, Qilong
    Guo, Jiong
    Chen, Jianer
    THEORETICAL COMPUTER SCIENCE, 2013, 511 : 2 - 12
  • [3] An Improved Kernel for Planar Connected Dominating Set
    Luo, Weizhong
    Wang, Jianxin
    Feng, Qilong
    Guo, Jiong
    Chen, Jianer
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 70 - 81
  • [4] A Linear Kernel for Planar Total Dominating Set
    Garnero, Valentin
    Sau, Ignasi
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2018, 20 (01):
  • [5] A linear kernel for planar red-blue dominating set
    Garnero, Valentin
    Sau, Ignasi
    Thilikos, Dimitrios M.
    DISCRETE APPLIED MATHEMATICS, 2017, 217 : 536 - 547
  • [6] Efficient data reduction for DOMINATING SET: A linear problem kernel for the planar case
    Alber, J
    Fellows, MR
    Niedermeier, R
    ALGORITHM THEORY - SWAT 2002, 2002, 2368 : 150 - 159
  • [7] Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set
    Gu, Qianping
    Imani, Navid
    LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 26 - 37
  • [8] Computational Study for Planar Connected Dominating Set Problem
    Marzban, Marjan
    Gu, Qian-Ping
    Jia, Xiaohua
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, 6509 : 107 - +
  • [9] 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
  • [10] 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
12345