Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/99111
| Title: | A 5k-vertex kernel for P2-packing | Authors: | Li, W Ye, J Cao, Y |
Issue Date: | 2-Apr-2022 | Source: | Theoretical computer science, 2 Apr. 2022, v. 910, p. 1-13 | Abstract: | The P2-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: | P2-packing Kernelization algorithm Crown decomposition |
Publisher: | Elsevier | Journal: | Theoretical computer science | ISSN: | 0304-3975 | DOI: | 10.1016/j.tcs.2022.01.032 | Rights: | © 2022 Elsevier B.V. All rights reserved. © 2022. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/. The following publication Li, W., Ye, J., & Cao, Y. (2022). A 5k-vertex kernel for P2-packing. Theoretical Computer Science, 910, 1-13 is available at https://dx.doi.org/10.1016/j.tcs.2022.01.032. |
| Appears in Collections: | Journal/Magazine Article |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Li_5k-vertex_kernel_P2-acking.pdf | Pre-Published version | 956.03 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
123
Last Week
2
2
Last month
Citations as of Nov 30, 2025
Downloads
42
Citations as of Nov 30, 2025
WEB OF SCIENCETM
Citations
2
Citations as of Dec 18, 2025
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.