A polynomial algorithm to find an independent set of maximum weight in a fork-free graph

The class of fork-free graphs is an extension of claw-free graphs and their subclass of line graphs. The first polynomial-time solution to the maximum weight independent set problem in the class of line graphs, which is equivalent to the maximum matching problem in general graphs, has been proposed by Edmonds in 1965 and then extended to the entire class of claw-free graphs by Minty in 1980. Recently, Alekseev proposed a solution for the larger class of fork-free graphs, but only for the unweighted version of the problem, i.e. finding an independent set of maximum cardinality. In the present paper, we describe the first polynomial-time algorithm to solve the problem for weighted fork-free graphs.

[1]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

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

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

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

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

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

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

[9]  Caterina De Simone,et al.  Stability Number of Bull- and Chair-Free Graphs , 1993, Discret. Appl. Math..

[10]  William J. Cook,et al.  Combinatorial optimization , 1997 .

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

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

[13]  Andreas Brandstädt,et al.  Structure and stability number of chair-, co-P- and gem-free graphs revisited , 2003, Inf. Process. Lett..

[14]  Andreas Brandstädt,et al.  Stability number of bull- and chair-free graphs revisited , 2003, Discret. Appl. Math..

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

[16]  Andreas Brandstädt,et al.  On minimal prime extensions of a four-vertex graph in a prime graph , 2004, Discret. Math..

[17]  Andreas Brandstädt,et al.  Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes , 2004, Inf. Process. Lett..

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