Sciweavers

Share
TAMC
2009
Springer

Linear Kernel for Planar Connected Dominating Set

10 years 1 months ago
Linear Kernel for Planar Connected Dominating Set
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.
Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
Added 27 May 2010
Updated 27 May 2010
Type Conference
Year 2009
Where TAMC
Authors Daniel Lokshtanov, Matthias Mnich, Saket Saurabh
Comments (0)
books