| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10332903 | Journal of Computer and System Sciences | 2013 | 13 Pages |
Abstract
⺠We propose a vertex-partition method for deriving linear kernels for planar graph problems. ⺠We improve the linear kernel for Connected Vertex Cover on planar graphs from 14k to 4k. ⺠We improve the linear kernel for Edge Dominating Set on planar graphs from 28k to 12k. ⺠We improve the linear kernel for Maximum Triangle Packing on planar graphs from 624k to 75k.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jianxin Wang, Yongjie Yang, Jiong Guo, Jianer Chen,