A $5k$ -vertex Kernel for $P_2$ -packing

preprint2022arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

A $5k$ -vertex Kernel for $P_2$ -packing

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

A 5k5k5k-vertex Kernel for P2P_2P2​-packing

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

A $5k$ -vertex Kernel for $P_2$ -packing