DeepAI AI Chat
Log In Sign Up

Exploiting 𝐜-Closure in Kernelization Algorithms for Graph Problems

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

A graph is c-closed if every pair of vertices with at least c common neighbors is adjacent. The c-closure of a graph G is the smallest number such that G is c-closed. Fox et al. [ICALP '18] defined c-closure and investigated it in the context of clique enumeration. We show that c-closure can be applied in kernelization algorithms for several classic graph problems. We show that Dominating Set admits a kernel of size k^O(c), that Induced Matching admits a kernel with O(c^7*k^8) vertices, and that Irredundant Set admits a kernel with O(c^(5/2)*k^3) vertices. Our kernelization exploits the fact that c-closed graphs have polynomially-bounded Ramsey numbers, as we show.


page 1

page 2

page 3

page 4


Detecting and Enumerating Small Induced Subgraphs in c-Closed Graphs

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

Computing Dense and Sparse Subgraphs of Weakly Closed Graphs

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

Finding Cliques in Social Networks: A New Distribution-Free Model

We propose a new distribution-free model of social networks. Our definit...

Essentially Tight Kernels for (Weakly) Closed Graphs

We study kernelization of classic hard graph problems when the input gra...

On the Minimum Cycle Cover problem on graphs with bounded co-degeneracy

In 2021, Duarte, Oliveira, and Souza [MFCS 2021] showed some problems th...

On the Relation of Strong Triadic Closure and Cluster Deletion

We study the parameterized and classical complexity of two related probl...

Parameterized Aspects of Strong Subgraph Closure

Motivated by the role of triadic closures in social networks, and the im...