A 5k-vertex Kernel for P_2-packing

04/09/2018
by   Wenjun Li, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/27/2022

Geodesic packing in graphs

Given a graph G, a geodesic packing in G is a set of vertex-disjoint max...
research
06/12/2020

On Packing Low-Diameter Spanning Trees

Edge connectivity of a graph is one of the most fundamental graph-theore...
research
12/30/2022

A quasi-quadratic vertex Kernel for Cograph edge editing

We provide a O(k^2 log k) vertex kernel for cograph edge editing. This i...
research
12/07/2018

Kernelization of Packing Problems

Kernelization algorithms are polynomial-time reductions from a problem t...
research
02/07/2018

The b-branching problem in digraphs

In this paper, we introduce the concept of b-branchings in digraphs, whi...
research
07/14/2022

Kernelization for Graph Packing Problems via Rainbow Matching

We introduce a new kernelization tool, called rainbow matching technique...
research
03/19/2018

Numerical Integration on Graphs: where to sample and how to weigh

Let G=(V,E,w) be a finite, connected graph with weighted edges. We are i...

Please sign up or login with your details

Forgot password? Click here to reset