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 条
  • [41] The effect of girth on the kernelization complexity of Connected Dominating Set
    Misra, Neeldhara
    Philip, Geevarghese
    Raman, Venkatesh
    Saurabh, Saket
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2010), 2010, 8 : 96 - 107
  • [42] A game theoretic approach for minimal connected dominating set
    Chen, Xiuyang
    Zhang, Zhao
    THEORETICAL COMPUTER SCIENCE, 2020, 836 (29-36) : 29 - 36
  • [43] Lossy Kernels for Connected Dominating Set on Sparse Graphs
    Eiben, Eduard
    Kumar, Mithilesh
    Mouawad, Amer E.
    Panolan, Fahad
    Siebertz, Sebastian
    35TH SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2018), 2018, 96
  • [44] Greedy approximation for the minimum connected dominating set with labeling
    Yang, Zishen
    Shi, Majun
    Wang, Wei
    OPTIMIZATION LETTERS, 2021, 15 (02) : 685 - 700
  • [45] Connected dominating set construction in cognitive radio networks
    Jiguo Yu
    Wenchao Li
    Xiuzhen Cheng
    Mohammed Atiquzzaman
    Hua Wang
    Li Feng
    Personal and Ubiquitous Computing, 2016, 20 : 757 - 769
  • [46] LOSSY KERNELS FOR CONNECTED DOMINATING SET ON SPARSE GRAPHS
    Eiben, Eduard
    Kumar, Mithilesh
    Mouawad, Amer E.
    Panolan, Fahad
    Siebertz, Sebastian
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (03) : 1743 - 1771
  • [47] Improved Algorithms for Construction of Connected Dominating Set in MANETs
    Chaturvedi, Omung
    Kaur, Parmeet
    Ahuja, Nishtha
    Prakash, Toshima
    2016 6th International Conference - Cloud System and Big Data Engineering (Confluence), 2016, : 559 - 564
  • [48] Greedy Algorithms for Minimum Connected Dominating Set Problems
    Yang, Deren
    Wang, Xiaofeng
    PROCEEDING OF THE 10TH INTERNATIONAL CONFERENCE ON INTELLIGENT TECHNOLOGIES, 2009, : 643 - 646
  • [49] Connected dominating set algorithms for wireless sensor networks
    Al-Nabhan, Najla
    Al-Rodhaan, Mznah
    Al-Dhelaan, Abdullah
    Cheng, Xiuzhen
    INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2013, 13 (02) : 121 - 134
  • [50] A New Linear Kernel for Undirected Planar Feedback Vertex Set: Smaller and Simpler
    Xiao, Mingyu
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2014, 2014, 8546 : 288 - 298
12345