A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs

The maximum stable set problem is NP-hard, even when restricted to triangle-free graphs. In particular, one cannot expect a polynomial time algorithm deciding if a bull-free graph has a stable set of size k, when k is part of the instance. Our main result in this paper is to show the existence of an FPT algorithm when we parameterize the problem by the solution size k. A polynomial kernel is unlikely to exist for this problem. We show however that our problem has a polynomial size Turing-kernel. More precisely, the hard cases are instances of size $${O}(k^5)$$O(k5). As a byproduct, if we forbid odd holes in addition to the bull, we show the existence of a polynomial time algorithm for the stable set problem. We also prove that the chromatic number of a bull-free graph is bounded by a function of its clique number and the maximum chromatic number of its triangle-free induced subgraphs. All our results rely on a decomposition theorem for bull-free graphs due to Chudnovsky which is modified here, allowing us to provide extreme decompositions, adapted to our computational purpose.

[1]  J. Hopcroft,et al.  Algorithm 447: efficient algorithms for graph manipulation , 1973, CACM.

[2]  Daniel Lokshtanov,et al.  Independent Set in P5-Free Graphs in Polynomial Time , 2014, SODA.

[3]  I. G. BONNER CLAPPISON.  Editor , 1960, The Electric Power Engineering Handbook - Five Volume Set.

[4]  Maria Chudnovsky.  The structure of bull-free graphs II — elementary trigraphs , 2011 .

[5]  Nicolas Trotignon,et al.  A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs , 2014, WG.

[6]  Kristina C. Garrett,et al.  A Combinatorial Proof of the Sum of q-Cubes , 2004, Electron. J. Comb..

[7]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[8]  Daniel Lokshtanov,et al.  New Methods in Parameterized Algorithms and Complexity , 2009 .

[9]  Henning Fernau,et al.  Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves , 2009, STACS.

[10]  P. Seymour,et al.  The Strong Perfect Graph Theorem , 2002, math/0212070.

[11]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[12]  Gianpaolo Oriolo,et al.  An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem , 2011, SODA '11.

[13]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[14]  Michel Habib,et al.  Algorithms for Some H-Join Decompositions , 2012, LATIN.

[15]  Alastair Farrugia.  Vertex-Partitioning into Fixed Additive Induced-Hereditary Properties is NP-hard , 2004, Electron. J. Comb..

[16]  Xi Wu,et al.  A Completeness Theory for Polynomial (Turing) Kernelization , 2013, Algorithmica.

[17]  Kazuhisa Makino,et al.  New Algorithms for Enumerating All Maximal Cliques , 2004, SWAT.

[18]  Nicolas Trotignon,et al.  Combinatorial optimization with 2-joins , 2013, J. Comb. Theory, Ser. B.

[19]  Maria Chudnovsky.  The structure of bull-free graphs III — global structure , 2011 .

[20]  Stéphan Thomassé,et al.  On Finding Directed Trees with Many Leaves , 2009, IWPEC.

[21]  Maria Chudnovsky,et al.  Coloring perfect graphs with no balanced skew-partitions , 2013, J. Comb. Theory B.

[22]  Maria Chudnovsky,et al.  The structure of bull-free graphs I - Three-edge-paths with centers and anticenters , 2012, J. Comb. Theory, Ser. B.

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

[24]  Michel Habib,et al.  A survey of the algorithmic aspects of modular decomposition , 2009, Comput. Sci. Rev..

[26]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[27]  N. Alon,et al.  The Probabilistic Method: Alon/Probabilistic , 2008 .

[28]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[29]  S. Poljak.  A note on stable sets and colorings of graphs , 1974 .

[30]  Bart M. P. Jansen,et al.  Turing kernelization for finding long paths and cycles in restricted graph classes , 2014, J. Comput. Syst. Sci..

[31]  Hazel Everett,et al.  An Algorithm for Finding Homogeneous Pairs , 1997, Discret. Appl. Math..

[32]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[33]  Vojtěch Rödl.  On the chromatic number of subgraphs of a given graph , 1977 .

[34]  Konrad Dabrowski,et al.  Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number , 2012, J. Discrete Algorithms.

[35]  A. Gyárfás.  Problems from the world surrounding perfect graphs , 1987 .

[36]  Andreas Brandstädt,et al.  Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull , 2012, Graphs Comb..

[37]  Maria Chudnovsky,et al.  The structure of bull-free graphs II and III - A summary , 2012, J. Comb. Theory, Ser. B.

[38]  Norbert Sauer,et al.  On the Density of Families of Sets , 1972, J. Comb. Theory A.

[39]  Paul D. Seymour,et al.  Recognizing Berge Graphs , 2005, Comb..