Linear Kernel for Planar Connected Dominating Set

Daniel Lokshtanov, Matthias Mnich, Saket Saurabh

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review

Abstract

We provide polynomial time data reduction rules for connected dominating set in 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 to obtain linear kernels for other problems on planar graphs.
Original languageEnglish
Title of host publicationTheory and Applications of Models of Computation
Subtitle of host publication6th Annual Conference, TAMC 2009, Changsha, China, May 18-22, 2009. Proceedings
EditorsJianer Chen, Barry S. Cooper
PublisherSpringer
Pages281-290
DOIs
Publication statusPublished - 2009
Externally publishedYes

Publication series

SeriesLecture Notes in Computer Science
Volume5532

Cite this