Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

145

AAIM
2010
Springer

144views Algorithms» more AAIM 2010»

Kernelization for Cycle Transversal Problems

15 years 10 months ago

Kernelization for Cycle Transversal Problems

Download faculty.kutztown.edu

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

Real-time Traffic

4-cycle Transversal | AAIM 2010 | Algorithms | S-cycle Transversal | S-cycle Transversal Problem |

claim paper

Related Content

» On the Small Cycle Transversal of Planar Graphs

» Compression via matroids a randomized polynomial kernel for odd cycle transversal

» Odd Cycle Packing

» Approximating Maximum Subgraphs without Short Cycles

» Kernel Bounds for Disjoint Cycles and Disjoint Paths

» Smooth Optimization for Effective Multiple Kernel Learning

» ShortestPath Kernels on Graphs

» Onthefly kernel updates for highperformance computing clusters

» The effect of girth on the kernelization complexity of Connected Dominating Set

Post Info
More Details (n/a)

Added	02 Aug 2010
Updated	02 Aug 2010
Type	Conference
Year	2010
Where	AAIM
Authors	Ge Xia, Yong Zhang

Comments (0)