Maximum Weight Independent Sets in hole- and co-chair-free graphs

The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most investigated and most important problems on graphs, it is well known to be NP-complete and hard to approximate. The complexity of MWIS is open for hole-free graphs (i.e., graphs without induced subgraphs isomorphic to a chordless cycle of length at least five). By applying a combination of clique separator and modular decomposition, we obtain a polynomial time solution of MWIS for hole- and co-chair-free graphs (the co-chair consists of five vertices four of which form a clique minus one edge - a diamond - and the fifth has degree one and is adjacent to one of the degree two vertices of the diamond).

[1]  Andreas Brandstädt,et al.  On alpha-redundant vertices in P5-free graphs , 2002, Inf. Process. Lett..

[2]  Vassilis Giakoumakis,et al.  Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences , 2011, Discret. Appl. Math..

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

[4]  Robert E. Tarjan,et al.  Decomposition by clique separators , 1985, Discret. Math..

[5]  Jeremy P. Spinrad,et al.  Improved algorithms for weakly chordal graphs , 2007, TALG.

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

[7]  A. Brandstädt,et al.  Graph Classes: A Survey , 1987 .

[8]  Pinar Heggernes,et al.  Recognizing Weakly Triangulated Graphs by Edge Separability , 2000, Nord. J. Comput..

[9]  Vadim V. Lozin,et al.  On Independent Vertex Sets in Subclasses of Apple-Free Graphs , 2010, Algorithmica.

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

[11]  S. Whitesides.  A Method for Solving Certain Graph Recognition and Optimization Problems, with Applications to Perfect Graphs , 1982 .

[12]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[13]  Jeremy P. Spinrad,et al.  Modular decomposition and transitive orientation , 1999, Discret. Math..

[14]  F. McMorris,et al.  Topics in Intersection Graph Theory , 1987 .

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

[16]  Ryan B. Hayward,et al.  Weakly triangulated graphs , 1985, J. Comb. Theory B.

[17]  Jeremy P. Spinrad,et al.  Weakly chordal graph algorithms via handles , 2000, SODA '00.

[18]  V. Chvátal,et al.  Topics on perfect graphs , 1984 .

[19]  Jeremy P. Spinrad,et al.  Algorithms for Weakly Triangulated Graphs , 1995, Discret. Appl. Math..

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

[21]  F. Radermacher,et al.  Substitution Decomposition for Discrete Structures and Connections with Combinatorial Optimization , 1984 .

[22]  Elaine M. Eschen,et al.  A Characterization of Some Graph Classes with No Long Holes , 1995, J. Comb. Theory, Ser. B.

[23]  Jeremy P. Spinrad.  Finding Large Holes , 1991, Inf. Process. Lett..

[24]  Chính T. Hoàng,et al.  Optimizing weakly triangulated graphs , 1989 .

[25]  Vadim V. Lozin,et al.  Maximum independent sets in subclasses of P5-free graphs , 2009, Inf. Process. Lett..