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 条
  • [31] Target Tracking based on Connected Dominating Set in WSN
    Wu zemin
    Wang hai
    2008 4TH INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-31, 2008, : 3792 - 3795
  • [32] Greedy approximation for the minimum connected dominating set with labeling
    Zishen Yang
    Majun Shi
    Wei Wang
    Optimization Letters, 2021, 15 : 685 - 700
  • [33] Connected dominating set construction in cognitive radio networks
    Yu, Jiguo
    Li, Wenchao
    Cheng, Xiuzhen
    Atiquzzaman, Mohammed
    Wang, Hua
    Feng, Li
    PERSONAL AND UBIQUITOUS COMPUTING, 2016, 20 (05) : 757 - 769
  • [34] Connected Dominating Set based Network Coding for SDN
    Singh, Amit
    Nagaraju, Anitha
    PROCEEDINGS OF THE 2016 2ND INTERNATIONAL CONFERENCE ON CONTEMPORARY COMPUTING AND INFORMATICS (IC3I), 2016, : 799 - 803
  • [35] The probabilistic and reliable connected power dominating set problems
    Ou Sun
    Neng Fan
    Optimization Letters, 2019, 13 : 1189 - 1206
  • [36] ALGORITHMS FOR MINIMUM CONNECTED CAPACITATED DOMINATING SET PROBLEM
    Shang, Weiping
    Wang, Xiumei
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2011, 3 (01) : 9 - 15
  • [37] On approximability of the independent/connected edge dominating set problems
    Fujito, T
    FST TCS 2000: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2000, 1974 : 117 - 126
  • [38] Minimum Connected Dominating set for Certain Circulant Networks
    Parthiban, N.
    Rajasingh, Indra
    Rajan, R. Sundara
    3RD INTERNATIONAL CONFERENCE ON RECENT TRENDS IN COMPUTING 2015 (ICRTC-2015), 2015, 57 : 587 - 591
  • [39] The probabilistic and reliable connected power dominating set problems
    Sun, Ou
    Fan, Neng
    OPTIMIZATION LETTERS, 2019, 13 (05) : 1189 - 1206
  • [40] Minimum connected dominating set and backbone of a random graph
    Habibulla, Yusupjan
    Zhou, Hai-Jun
    JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2024, 2024 (06):
12345