Linear Problem Kernels for Planar Graph Problems with Small Distance Property
Recently, various linear problem kernels for NP-hard planar graph problems have been achieved, finally resulting in a meta-theorem for classification of problems admitting linear kernels. Almost all of these results are based on a so-called region decomposition technique. In this paper, we introduce a simple partition of the vertex set to analyze kernels for planar graph problems which admit the distance property with small constants. Without introducing new reduction rules, this vertex partition directly leads to improved kernel sizes for several problems. Moreover, we derive new kernelization algorithms for Connected Vertex Cover, Edge Dominating Set, and Maximum Triangle Packing problems, further improving the kernel size upper bounds for these problems.
KeywordsPlanar Graph Vertex Cover Linear Kernel Kernel Size Reduction Rule
Unable to display preview. Download preview PDF.
- 3.Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) Kernelization. In: FOCS 2009, pp. 629–638. IEEE Computer Society, Los Alamitos (2009)Google Scholar
- 14.Prieto, E.: Systematic Kernelization in FPT Algorithm Design. Ph.D. thesis, Department of Computer Science, University of Newcastle, Australia (2005)Google Scholar
- 15.Privadarsini, P., Hemalatha, T.: Connected vertex cover in 2-connected planar graph with maximum degree 4 is NP-complete. International Journal of Mathematical, Physical and Engineering Sciences 2(1), 51–54 (2008)Google Scholar