Some observations on maximum weight stable sets in certain P

Abstract The maximum weight stable set problem (MWS) is the weighted version of the maximum stable set problem (MS), which is NP-hard. The class of P5-free graphs – i.e., graphs with no induced path of five vertices – is the unique minimal class, defined by forbidding a single connected subgraph, for which the computational complexity of MS is an open question. At the same time, it is known that MS can be efficiently solved for ( P 5 , F ) -free graphs, where F is any graph of five vertices different to a C5. In this paper we introduce some observations on P5-free graphs, and apply them to introduce certain subclasses of such graphs for which one can efficiently solve MWS. That extends or improves some known results, and implies – together with other known results – that MWS can be efficiently solved for ( P 5 , F ) -free graphs where F is any graph of five vertices different to a C5.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  Vassilis Giakoumakis,et al.  Weighted Parameters in (P5, P5)-free Graphs , 1997, Discret. Appl. Math..

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

[4]  Vadim V. Lozin,et al.  A note on alpha-redundant vertices in graphs , 2001, Discret. Appl. Math..

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

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

[7]  Frederic Maire,et al.  On graphs without P5 and P5_ , 1995, Discret. Math..

[8]  Jinquan Dong.  On the diameter of i-center in a graph without long induced paths , 1999 .

[9]  Z. Tuza,et al.  Dominating cliques in P5-free graphs , 1990 .

[10]  Martin Farber,et al.  On diameters and radii of bridged graphs , 1989, Discret. Math..

[11]  A. Tamura,et al.  A revision of Minty's algorithm for finding a maximum weight stable set of a claw-free graph , 2001 .

[12]  Peter L. Hammer,et al.  On the Stability Number of Claw-free P5-free and More General Graphs , 1999, Discret. Appl. Math..

[13]  Zsolt Tuza,et al.  A characterization of graphs without long induced paths , 1990, J. Graph Theory.

[14]  Vadim V. Lozin,et al.  Independent sets in extensions of 2K2-free graphs , 2005, Discret. Appl. Math..

[15]  Lorna Stewart,et al.  A Linear Recognition Algorithm for Cographs , 1985, SIAM J. Comput..

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

[17]  Vadim V. Lozin,et al.  Stability in P5- and banner-free graphs , 2000, Eur. J. Oper. Res..

[18]  V. E. Alekseev,et al.  On easy and hard hereditary classes of graphs with respect to the independent set problem , 2003, Discret. Appl. Math..

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

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

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

[22]  Raffaele Mosca.  Some results on maximum stable sets in certain P5-free graphs , 2003, Discret. Appl. Math..

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

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

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

[26]  Zsolt Tuza,et al.  An upper bound on the number of cliques in a graph , 1993, Networks.

[27]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[28]  C. De Simone,et al.  On the vertex packing problem , 1993, Graphs Comb..

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

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

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

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

[33]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.