Linear Problem Kernels for NP-Hard Problems on Planar Graphs

Abstract. We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several concrete case studies, giving new kernelization results for Connected Vertex Cover, Minimum Edge Dominating Set, Maximum Triangle Packing, and Efficient Dominating Set on planar graphs. On the route to these results, we present effective, problem-specific data reduction rules that are useful in any approach attacking the computational intractability of these problems.

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Jiong Guo, Rolf Niedermeier
• Keywords: Dominating Set, EDGE DOMINATING SET, ICALP 2007, Planar Graphs, Theoretical Computer Science