Kernelization for cycle transversal problems

Authors:
Ge Xia;Yong Zhang
Affiliations:
Department of Computer Science, Lafayette College, Easton, PA;Department of Computer Science, Kutztown University, Kutztown, PA
Venue:
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Year:
2010

Citing 18
Cited 2

There is no universal countable pentagon-free graph

Journal of Graph Theory
On a conjecture of Tuza about packing and covering of triangles

Discrete Mathematics
On the number of edges of quadrilateral-free graphs

Journal of Combinatorial Theory Series B
Node-and edge-deletion NP-complete problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
On the Chromatic Number of Triangle-Free Graphs of Large Minimum Degree

Combinatorica
A Note on Bipartite Graphs Without 2k-Cycles

Combinatorics, Probability and Computing
Invitation to data reduction and problem kernelization

ACM SIGACT News
On The Chromatic Number Of Pentagon-Free Graphs Of Large Minimum Degree

Combinatorica
Vertex cover might be hard to approximate to within 2-ε

Journal of Computer and System Sciences
Approximating Maximum Subgraphs without Short Cycles

APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
M-degrees of quadrangle-free planar graphs

Journal of Graph Theory
A Problem Kernelization for Graph Packing

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Adapted list coloring of planar graphs

Journal of Graph Theory
(Meta) Kernelization

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Which Codes Have -Cycle-Free Tanner Graphs?

IEEE Transactions on Information Theory
Linear problem kernels for NP-hard problems on planar graphs

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Kernelization algorithms for d-hitting set problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Parameterized Complexity

Parameterized Complexity

On the small cycle transversal of planar graphs

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On the small cycle transversal of planar graphs

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.