@article{2d429b9363c04250a9c0d2d7f286b442,
title = "A 5k-vertex kernel for P2-packing",
abstract = "The P 2-packing problem asks whether a graph contains k vertex-disjoint (not necessarily induced) paths each of length two. We continue the study of its kernelization algorithms, and develop a 5k-vertex kernel.",
keywords = "Crown decomposition, Kernelization algorithm, P2-packing",
author = "Wenjun Li and Junjie Ye and Yixin Cao",
note = "Funding Information: Supported by the National Natural Science Foundation of China (NSFC) under grant 61872048 and the Research Foundation of Education Bureau of Hunan Province under grant 21B0305.Supported in part by the Hong Kong Research Grants Council (RGC) under grants 15221420 and 15201317, and the National Natural Science Foundation of China (NSFC) under grant 61972330. Publisher Copyright: {\textcopyright} 2022 Elsevier B.V.",
year = "2022",
month = apr,
day = "2",
doi = "10.1016/j.tcs.2022.01.032",
language = "English",
volume = "910",
pages = "1--13",
journal = "Theoretical Computer Science",
issn = "0304-3975",
publisher = "Elsevier B.V.",
number = "1",
}