An improved kernel for the cycle contraction problem
Data Structures and Algorithms
2017-06-20 v1
Abstract
The problem of modifying a given graph to satisfy certain properties has been one of the central topics in parameterized tractability study. In this paper, we study the cycle contraction problem, which makes a graph into a cycle by edge contractions. The problem has been studied {by Belmonte et al. [IPEC 2013]} who obtained a linear kernel with at most vertices. We provide an improved kernel with at most vertices for it in this paper.
Cite
@article{arxiv.1706.05628,
title = {An improved kernel for the cycle contraction problem},
author = {Bin Sheng and Yuefang Sun},
journal= {arXiv preprint arXiv:1706.05628},
year = {2017}
}
Comments
12 pages, 3 figures