An algorithmic decomposition of claw-free graphs leading to an O(n3)-algorithm for the weighted stable set problem

We propose an algorithm for solving the maximum weighted stable set problem on claw-free graphs that runs in O(n3)--time, drastically improving the previous best known complexity bound. This algorithm is based on a novel decomposition theorem for claw-free graphs, which is also introduced in the present paper. Despite being weaker than the well-known structure result for claw-free graphs given by Chudnovsky and Seymour [5], our decomposition theorem is, on the other hand, algorithmic, i.e. it is coupled with an O(n3)-time procedure that actually produces the decomposition. We also believe that our algorithmic decomposition result is interesting on its own and might be also useful to solve other kind of problems on claw-free graphs.

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

[2]  Paul D. Seymour,et al.  Claw-free graphs. V. Global structure , 2008, J. Comb. Theory, Ser. B.

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

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

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

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

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

[8]  David K. Smith.  Network Flows: Theory, Algorithms, and Applications , 1994 .

[9]  Nick Roussopoulos,et al.  A MAX{m, n} Algorithm for Determining the Graph H from Its Line Graph C , 1973, Inf. Process. Lett..

[10]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.

[11]  Andrew D. King.  Claw-free graphs and two conjectures on omega, delta, and chi , 2009 .

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

[13]  Gianpaolo Oriolo,et al.  A New Algorithm for the Maximum Weighted Stable Set Problem in Claw-Free Graphs , 2008, IPCO.

[14]  Feodor F. Dragan,et al.  On linear and circular structure of (claw, net)-free graphs , 2003, Discret. Appl. Math..

[15]  Dieter Kratsch,et al.  On claw-free asteroidal triple-free graphs , 1999, Discret. Appl. Math..

[16]  Jean-Luc Fouquet,et al.  A Strengthening of Ben Rebea's Lemma , 1993, J. Comb. Theory, Ser. B.

[17]  Paul D. Seymour,et al.  The structure of claw-free graphs , 2005, BCC.

[18]  William R. Pulleyblank,et al.  Formulations for the stable set polytope of a claw-free graph , 1993, IPCO.