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 条

[21] Improved parameterized algorithms for planar dominating set
Kanj, IA
Perkovic, L
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 399 - 410
[22] Computational study on planar dominating set problem
Marzban, Marjan
Gu, Qian-Ping
Jia, Xiaohua
THEORETICAL COMPUTER SCIENCE, 2009, 410 (52) : 5455 - 5466
[23] DIMENSION OF THE KERNEL OF A PLANAR SET
BREEN, M
PACIFIC JOURNAL OF MATHEMATICS, 1979, 82 (01) : 15 - 21
[24] Forwarding Set Based Distributed Algorithm for Connected Dominating Set in WSN
Tang, Yong
Zhang, Jun
Wang, Wenyong
Xiang, Yu
Zhang, Jun
SENSOR LETTERS, 2012, 10 (08) : 1918 - 1924
[25] Linear separation of connected dominating sets in graphs
Chiarelli, Nina
Milanic, Martin
ARS MATHEMATICA CONTEMPORANEA, 2019, 16 (02) : 487 - 525
[26] BELOW ALL SUBSETS FOR MINIMAL CONNECTED DOMINATING SET
Lokshtanov, Daniel
Pilipczuk, Micha L.
Saurabh, Saket
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2018, 32 (03) : 2332 - 2345
[27] A firefly optimization for a connected dominating set in a sensor network
Matsumoto, Yuta
Fujiwara, Akihiro
2017 FIFTH INTERNATIONAL SYMPOSIUM ON COMPUTING AND NETWORKING (CANDAR), 2017, : 594 - 596
[28] Overlapped Connected Dominating Set for Big Data Security
Yi, Li
Fang, Weidong
Chen, Wei
Zhang, Wuxiong
Jia, Guoqing
IEEE INFOCOM 2022 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2022,
[29] Connected Dominating Set Construction in Cognitive Radio Networks
Yu, Jiguo
Li, Wenchao
Feng, Li
2015 INTERNATIONAL CONFERENCE ON IDENTIFICATION, INFORMATION, AND KNOWLEDGE IN THE INTERNET OF THINGS (IIKI), 2015, : 276 - 279
[30] On approximability of the independent/connected edge dominating set problems
Fujito, T
INFORMATION PROCESSING LETTERS, 2001, 79 (06) : 261 - 266

← 1 2 3 4 5 →