Linear Problem Kernels for Planar Graph Problems with Small Distance Property Conference Paper uri icon

abstract

  • 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. 2011 Springer-Verlag GmbH.

name of conference

  • Mathematical Foundations of Computer Science 2011 - 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011. Proceedings

published proceedings

  • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

author list (cited authors)

  • Wang, J., Yang, Y., Guo, J., & Chen, J.

citation count

  • 5

complete list of authors

  • Wang, Jianxin||Yang, Yongjie||Guo, Jiong||Chen, Jianer

publication date

  • September 2011