A 5k-vertex kernel for P2-packing

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.

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 910; pp. 1 - 13
Main Authors: Li, Wenjun, Ye, Junjie, Cao, Yixin
Format: Journal Article
Language:English
Published: Elsevier B.V 02.04.2022
Subjects:
Crown decomposition
Kernelization algorithm
P2-packing
Crown decomposition
P2-packing
Kernelization algorithm
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2022.01.032