Independence and Efficient Domination on P6-free Graphs

In the Maximum Weight Independent Set problem, the input is a graph G, every vertex has a non-negative integer weight, and the task is to find a set S of pairwise nonadjacent vertices, maximizing the total weight of the vertices in S. We give an nO(log2 n) time algorithm for this problem on graphs excluding the path P6 on 6 vertices as an induced subgraph. Currently, there is no constant k known for which Maximum Weight Independent Set on Pk-free graphs becomes NP-hard, and our result implies that if such a k exists, then k > 6 unless all problems in NP can be decided in quasi-polynomial time. Using the combinatorial tools that we develop for this algorithm, we also give a polynomial-time algorithm for Maximum Weight Efficient Dominating Set on P6-free graphs. In this problem, the input is a graph G, every vertex has an integer weight, and the objective is to find a set S of maximum weight such that every vertex in G has exactly one vertex in S in its closed neighborhood or to determine that no such set exists. Prior to our work, the class of P6-free graphs was the only class of graphs defined by a single forbidden induced subgraph on which the computational complexity of Maximum Weight Efficient Dominating Set was unknown.

[1]  Jeremy P. Spinrad,et al.  On algorithms for (P5, gem)-free graphs , 2005, Theor. Comput. Sci..

[2]  Andreas Brandstädt,et al.  P6- and triangle-free graphs revisited: structure and bounded clique-width , 2006, Discret. Math. Theor. Comput. Sci..

[3]  Vadim V. Lozin,et al.  On the stable set problem in special P5-free graphs , 2003, Discret. Appl. Math..

[4]  Vadim V. Lozin,et al.  An augmenting graph approach to the stable set problem in P5-free graphs , 2003, Discret. Appl. Math..

[5]  Najiba Sbihi,et al.  Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile , 1980, Discret. Math..

[6]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[7]  Raffaele Mosca,et al.  Some Results on Stable Sets for k-Colorable P6-Free Graphs and Generalizations , 2012, Discret. Math. Theor. Comput. Sci..

[8]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

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

[10]  V. E. Alekseev,et al.  Polynomial algorithm for finding the largest independent sets in graphs without forks , 2004, Discret. Appl. Math..

[11]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[12]  Martin Milanic,et al.  New Polynomial Cases of the Weighted Efficient Domination Problem , 2013, MFCS.

[13]  Andreas Brandstädt,et al.  Weighted Efficient Domination for $P_6$-Free Graphs in Polynomial Time , 2015, ArXiv.

[14]  Andreas Brandstädt,et al.  Weighted Efficient Domination for P_6 -Free and for P_5 -Free Graphs , 2016, WG.

[15]  Richard C. T. Lee,et al.  The Weighted Perfect Domination Problem and Its Variants , 1996, Discret. Appl. Math..

[16]  N. Biggs.  Perfect codes in graphs , 1973 .

[17]  M. Golumbic.  CHAPTER 3 – Perfect Graphs , 1980 .

[18]  Manu Basavaraju,et al.  Maximum weight independent sets in hole- and dart-free graphs , 2012, Discret. Appl. Math..

[19]  Pinar Heggernes,et al.  Minimal triangulations of graphs: A survey , 2006, Discret. Math..

[20]  Andreas Brandstädt,et al.  Maximum Weight Independent Sets for (, triangle)-free graphs in polynomial time , 2015, Discret. Appl. Math..

[21]  Reinhard Diestel,et al.  Graph Theory, 4th Edition , 2012, Graduate texts in mathematics.

[22]  Dieter Kratsch,et al.  Independent Sets in Asteroidal Triple-Free Graphs , 1997, SIAM J. Discret. Math..

[23]  Michal Pilipczuk,et al.  Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs , 2017, SODA.

[24]  Zsolt Tuza,et al.  H-Free Graphs, Independent Sets, and Subexponential-Time Algorithms , 2017, IPEC.

[25]  Frédéric Maffray,et al.  The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free Graphs , 2016, WG.

[26]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[27]  Frédéric Maffray,et al.  Weighted independent sets in classes of P6-free graphs , 2016, Discret. Appl. Math..

[28]  Derek G. Corneil,et al.  Complement reducible graphs , 1981, Discret. Appl. Math..

[29]  Andreas Brandstädt,et al.  Efficient Domination for Some Subclasses of P_6 -free Graphs in Polynomial Time , 2015, WG.

[30]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[31]  T. Karthick,et al.  Weighted independent sets in a subclass of P6-free graphs , 2015, Discret. Math..

[32]  Vassilis Giakoumakis,et al.  Addendum to: Maximum Weight Independent Sets in hole- and co-chair-free graphs , 2015, Inf. Process. Lett..

[33]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory, Ser. B.

[34]  Raffaele Mosca,et al.  Polynomial Algorithms for the Maximum Stable Set Problem on Particular Classes of P_5-Free Graphs , 1997, Inf. Process. Lett..

[35]  Raffaele Mosca.  Maximum weight independent sets in (P6, co-banner)-free graphs , 2013, Inf. Process. Lett..

[36]  Christoph Brause.  A subexponential-time algorithm for the Maximum Independent Set Problem in Pt-free graphs , 2017, Discret. Appl. Math..

[37]  Peter J. Slater,et al.  Fundamentals of domination in graphs , 1998, Pure and applied mathematics.

[38]  Andreas Brandstädt,et al.  Weighted efficient domination in two subclasses of P6-free graphs , 2016, Discret. Appl. Math..

[39]  Dieter Rautenbach,et al.  Some results on graphs without long induced paths , 2003, Inf. Process. Lett..

[40]  Vadim V. Lozin,et al.  Stable sets in two subclasses of banner-free graphs , 2003, Discret. Appl. Math..

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

[42]  Andreas Brandstädt,et al.  Efficient domination for classes of P6-free graphs , 2017, Discret. Appl. Math..

[43]  Andreas Brandstädt,et al.  On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem , 2005, Theor. Comput. Sci..

[44]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[45]  Andreas Brandstädt,et al.  On the structure and stability number of P5- and co-chair-free graphs , 2003, Discret. Appl. Math..

[46]  Peter Buneman,et al.  A characterisation of rigid circuit graphs , 1974, Discret. Math..

[47]  Raffaele Mosca,et al.  Stable sets of maximum weight in (P7, banner)-free graphs , 2008, Discret. Math..

[48]  Raffaele Mosca,et al.  Independent sets in (P6, diamond)-free graphs , 2009, Discret. Math. Theor. Comput. Sci..

[49]  Ingo Schiermeyer,et al.  On maximum independent sets in P5-free graphs , 2010, Discret. Appl. Math..

[50]  Vassilis Giakoumakis,et al.  Weighted Efficient Domination for $(P_5+kP_2)$-Free Graphs in Polynomial Time , 2014, ArXiv.

[51]  Andreas Brandstädt,et al.  Weighted Efficient Domination for P5-Free and P6-Free Graphs , 2016, SIAM J. Discret. Math..

[52]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[53]  Ioan Todinca,et al.  Treewidth and Minimum Fill-in: Grouping the Minimal Separators , 2001, SIAM J. Comput..

[54]  Raffaele Mosca.  Stable sets for (P6, K2, 3)-free graphs , 2012, Discuss. Math. Graph Theory.

[55]  Raffaele Mosca.  Stable Sets in Certain P6-free Graphs , 1999, Discret. Appl. Math..

[56]  ZverovichIE,et al.  STABILITY NUMBER IN SUBCLASSES OF P5-FREE GRAPHS , 2004 .

[57]  Andreas Brandstädt,et al.  Weighted Efficient Domination in Classes of P6-free Graphs , 2015, ArXiv.

[58]  Zverovich Ie,et al.  Stability number in subclasses of P5-free graphs , 2004 .

[59]  Martin Milanič,et al.  A polynomial algorithm to find an independent set of maximum weight in a fork-free graph , 2006, SODA '06.

[60]  Jinquan Dong.  Some results on graphs without long induced paths , 1996 .

[61]  Yukio Shibata,et al.  On the tree representation of chordal graphs , 1988, J. Graph Theory.