Linear Kernel for Planar Connected Dominating Set

@article{Lokshtanov2009LinearKF,
  title={Linear Kernel for Planar Connected Dominating Set},
  author={Daniel Lokshtanov and Matthias Mnich and Saket Saurabh},
  journal={Theor. Comput. Sci.},
  year={2009},
  volume={412},
  pages={2536-2543}
}
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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Similar Papers

Loading similar papers…