On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal

@inproceedings{Jansen2011OnPK,
title={On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal},
author={Bart M. P. Jansen and Stefan Kratsch},
booktitle={IPEC},
year={2011}
}

TheOdd Cycle Transversal problem (oct) asks whether a given graph can be made bipartite (i.e., 2-colorable) by deleting at most l vertices. We study structural parameterizations of oct with respect to their polynomial kernelizability, i.e., whether instances can be efficiently reduced to a size polynomial in the chosen parameter. It is a major open problem in parameterized complexity whether Odd Cycle Transversal admits a polynomial kernel when parameterized by l. On the positive side, we show… CONTINUE READING