2024/11/07 by Koana, Tomohiro, Komusiewicz, Christian, Sommer, Frank
#500 Naturwissenschaften und Mathematik::510 Mathematik::510 Mathematik #Ramsey numbers #c-closure #capacitated vertex cover #dominating set #fixed-parameter tractability #independent set #induced matching #kernelization #weak γ-closure
paper · doi:10.14279/depositonce-21690
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 weak closure number γ(Fox et al. SIAM J Comput 49(2):448–464, 2020) in addition to the standard parameter solution size k . The weak closure number γof a graph is upper-bounded by the minimum of its closure number c and its degeneracy d . For Capacitated Vertex Cover , Connected Vertex Cover , and Induced Matching we obtain the first kernels of size kO(γ), kO(γ), and (γk)O(γ), respectively. This extends previous results on the kernelization of these problems on degenerate graphs. These kernels are essentially tight as these problems are unlikely to admit kernels of size ko(γ)by previous results on their kernelization complexity on degenerate graphs (Cygan et al. ACM Trans Algorithms 13(3):43:1–43:22, 2017). For Capacitated Vertex Cover , we show that even a kernel of size ko(c)is unlikely. In contrast, for Connected Vertex Cover , we obtain a kernel with O(ck2) vertices. Moreover, we prove that searching for an induced subgraph of order at least k belonging to a hereditary graph class Gadmits a kernel of size kO(γ)when Gcontains all complete and all edgeless graphs. Finally, 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.