Maximum weight independent sets in hole- and dart-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. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n^3)-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n^4)-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs.

[1]  Chính T. Hoàng,et al.  Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs , 1994, Discret. Appl. Math..

[2]  Vadim V. Lozin,et al.  Independent Sets of Maximum Weight in Apple-Free Graphs , 2008, SIAM J. Discret. Math..

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

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

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

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

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

[8]  Andreas Brandstädt,et al.  New applications of clique separator decomposition for the Maximum Weight Stable Set problem , 2007, Theor. Comput. Sci..

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

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

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

[12]  Dominique de Werra,et al.  Four classes of perfectly orderable graphs , 1987, J. Graph Theory.

[13]  Vassilis Giakoumakis,et al.  Maximum Weight Independent Sets in hole- and co-chair-free graphs , 2012, Inf. Process. Lett..

[14]  D. West.  Introduction to Graph Theory , 1995 .

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

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

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

[18]  Derek G. Corneil.  The complexity of generalized clique packing , 1985, Discret. Appl. Math..

[19]  Jean Fonlupt,et al.  The complexity of generalized clique covering , 1989, Discret. Appl. Math..

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