Kernelization for Cycle Transversal Problems
Algorithmic Applications in Management（2010）
摘要
We present new kernelization results for the s -cycle transversal problem for s > 3. In particular, we show a 6k 2 kernel for 4-cycle transversal and a O(k s − 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.
更多查看译文
关键词
general graph,new kernelization result,vertex kernel,4-cycle transversal,cycle transversal problem,following linear vertex kernel,planar graphs-a,planar graph,s-cycle transversal,cycle transversal,kernelization,planar graphs
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要