The $P_2$-packing problem asks for whether a graph contains $k$ vertex-disjoint paths each of length two. We continue the study of its kernelization algorithms, and develop a $5k$-vertex kernel.

翻译：$P$2美元包装问题询问图表是否包含两长每一长的脊椎脱节路径。 我们继续研究其内分泌算法,并开发一个 $5k$的顶部内核。