DeepAI AI Chat
Log In Sign Up

Essentially Tight Kernels for (Weakly) Closed Graphs

by   Tomohiro Koana, et al.
Philipps-Universität Marburg
Berlin Institute of Technology (Technische Universität Berlin)

We study kernelization of classic hard graph problems when the input graphs fulfill triadic closure properties. More precisely, we consider the recently introduced parameters closure number c and the weak closure number γ [Fox et al., SICOMP 2020] in addition to the standard parameter solution size k. For Capacitated Vertex Cover, Connected Vertex Cover, and Induced Matching we obtain the first kernels of size k^𝒪(γ) and (γ k)^𝒪(γ), respectively, thus extending previous kernelization results on degenerate graphs. The kernels are essentially tight, since these problems are unlikely to admit kernels of size k^o(γ) by previous results on their kernelization complexity in degenerate graphs [Cygan et al., ACM TALG 2017]. In addition, we provide lower bounds for the kernelization of Independent Set on graphs with constant closure number c and kernels for Dominating Set on weakly closed split graphs and weakly closed bipartite graphs.


page 1

page 2

page 3

page 4


Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

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

Kernelization of Maximum Minimal Vertex Cover

In the Maximum Minimal Vertex Cover (MMVC) problem, we are given a graph...

Exploiting 𝐜-Closure in Kernelization Algorithms for Graph Problems

A graph is c-closed if every pair of vertices with at least c common nei...

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

Let ℱ be a family of graphs, and let p,r be nonnegative integers. The (p...

Smaller parameters for vertex cover kernelization

We revisit the topic of polynomial kernels for Vertex Cover relative to ...

Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs

Fox et al. [SIAM J. Comp. 2020] introduced a new parameter, called c-clo...

Kernelization of Packing Problems

Kernelization algorithms are polynomial-time reductions from a problem t...