Sciweavers

AAIM
2010
Springer

Kernelization for Cycle Transversal Problems

14 years 3 months ago
Kernelization for Cycle Transversal Problems
Abstract. We present new kernelization results for the s-cycle transversal problem for s > 3. In particular, we show a 6k2 kernel for 4-cycle transversal and a O(ks−1 ) kernel for s-cycle transversal when s > 4. We prove the NP-completeness of s-cycle transversal on planar graphs and obtain a 74k kernel for 4-cycle transversal on planar graphs. We also give several kernelization results for a related problem (≤ s)-cycle transversal.
Ge Xia, Yong Zhang
Added 02 Aug 2010
Updated 02 Aug 2010
Type Conference
Year 2010
Where AAIM
Authors Ge Xia, Yong Zhang
Comments (0)