Essentially Tight Kernels for (Weakly) Closed Graphs

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 kO(γ) and (γk)O(γ), respectively, thus extending previous kernelization results on degenerate graphs. The kernels are essentially tight, since these problems are unlikely to admit kernels of size ko(γ) 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. 2012 ACM Subject Classification Theory of computation → Parameterized complexity and exact algorithms; Theory of computation → Graph algorithms analysis

[1]  Dániel Marx,et al.  Kernelization of packing problems , 2012, SODA.

[2]  Peter Frankl,et al.  Intersection theorems with geometric consequences , 1981, Comb..

[3]  Xi Wu,et al.  Weak compositions and their applications to polynomial lower bounds for kernelization , 2012, SODA.

[4]  Noga Alon,et al.  Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs , 2007, Algorithmica.

[5]  Stefan Kratsch,et al.  Kernel Lower Bounds using Co-Nondeterminism: Finding Induced Hereditary Subgraphs , 2012, TOCT.

[6]  H. L. Abbott,et al.  Intersection Theorems for Systems of Sets , 1972, J. Comb. Theory, Ser. A.

[7]  Geevarghese Philip,et al.  Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond , 2012, TALG.

[8]  Lukasz Kowalik,et al.  Improved Induced Matchings in Sparse Graphs , 2009, IWPEC.

[9]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[10]  Paul Erdös,et al.  Ramsey-type theorems , 1989, Discret. Appl. Math..

[11]  T. Roughgarden,et al.  FPT Algorithms for Finding Dense Subgraphs in c-Closed Graphs , 2020, ArXiv.

[12]  Jan Arne Telle,et al.  FPT Algorithms for Domination in Biclique-Free Graphs , 2012, ESA.

[13]  Fabrizio Grandoni,et al.  Tight Kernel Bounds for Problems on Graphs with Small Degeneracy , 2017, ACM Trans. Algorithms.

[14]  Marek Karpinski,et al.  Approximation Hardness of Short Symmetric Instances of MAX-3SAT , 2003, Electron. Colloquium Comput. Complex..

[15]  Michael R. Fellows,et al.  Fundamentals of Parameterized Complexity , 2013 .

[16]  Stefan Kratsch,et al.  Recent developments in kernelization: A survey , 2014, Bull. EATCS.

[17]  Michal Pilipczuk,et al.  Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs , 2010, WG.

[18]  Venkatesh Raman,et al.  Parameterized complexity of finding subgraphs with hereditary properties , 2000, Theor. Comput. Sci..

[19]  Stefan Kratsch,et al.  Co-Nondeterminism in Compositions: A Kernelization Lower Bound for a Ramsey-Type Problem , 2011, TALG.

[20]  Saket Saurabh,et al.  Kernelization Lower Bounds Through Colors and IDs , 2014, ACM Trans. Algorithms.

[21]  Tim Roughgarden,et al.  Finding Cliques in Social Networks: A New Distribution-Free Model , 2018, ICALP.

[22]  Christian Komusiewicz,et al.  Exploiting c-Closure in Kernelization Algorithms for Graph Problems , 2020, ESA.

[23]  Ge Xia,et al.  On the induced matching problem , 2011, J. Comput. Syst. Sci..

[24]  Saket Saurabh,et al.  Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles , 2008, Algorithmica.

[25]  Jeremy P. Spinrad,et al.  On graphs without a C4 or a diamond , 2011, Discret. Appl. Math..