Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes

07/14/2022
by   Jungho Ahn, et al.
0

Let ℱ be a family of graphs, and let p,r be nonnegative integers. The (p,r,ℱ)-Covering problem asks whether for a graph G and an integer k, there exists a set D of at most k vertices in G such that G^p∖ N_G^r[D] has no induced subgraph isomorphic to a graph in ℱ, where G^p is the p-th power of G. The (p,r,ℱ)-Packing problem asks whether for a graph G and an integer k, G^p has k induced subgraphs H_1,…,H_k such that each H_i is isomorphic to a graph in ℱ, and for distinct i,j∈{1, …, k}, the distance between V(H_i) and V(H_j) in G is larger than r. We show that for every fixed nonnegative integers p,r and every fixed nonempty finite family ℱ of connected graphs, the (p,r,ℱ)-Covering problem with p≤2r+1 and the (p,r,ℱ)-Packing problem with p≤2⌊ r/2⌋+1 admit almost linear kernels on every nowhere dense class of graphs, and admit linear kernels on every class of graphs with bounded expansion, parameterized by the solution size k. We obtain the same kernels for their annotated variants. As corollaries, we prove that Distance-r Vertex Cover, Distance-r Matching, ℱ-Free Vertex Deletion, and Induced-ℱ-Packing for any fixed finite family ℱ of connected graphs admit almost linear kernels on every nowhere dense class of graphs and linear kernels on every class of graphs with bounded expansion. Our results extend the results for Distance-r Dominating Set by Drange et al. (STACS 2016) and Eickmeyer et al. (ICALP 2017), and the result for Distance-r Independent Set by Pilipczuk and Siebertz (EJC 2021).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/24/2017

On the Parallel Parameterized Complexity of the Graph Isomorphism Problem

In this paper, we study the parallel and the space complexity of the gra...
research
09/15/2018

Kernelization and approximation of distance-r independent sets on nowhere dense graphs

For a positive integer r, a distance-r independent set in an undirected ...
research
01/08/2020

Induced odd cycle packing number, independent sets, and chromatic number

The induced odd cycle packing numberiocp(G) of a graph G is the maximum ...
research
04/25/2018

A quasi linear-time b-Matching algorithm on distance-hereditary graphs and bounded split-width graphs

We present a quasi linear-time algorithm for Maximum Matching on distanc...
research
03/05/2021

Essentially Tight Kernels for (Weakly) Closed Graphs

We study kernelization of classic hard graph problems when the input gra...
research
07/14/2022

Kernelization for Graph Packing Problems via Rainbow Matching

We introduce a new kernelization tool, called rainbow matching technique...
research
07/10/2020

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

A graph G is weakly γ-closed if every induced subgraph of G contains one...

Please sign up or login with your details

Forgot password? Click here to reset