An algorithmic decomposition of claw-free graphs leading to an O(n^3) 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(n^3)-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 intioduced in the present paper. Despite being weaker than the well-known structure result for claw-free graphs given by Chudnovsky and Seymour, our decomposition theorem is, on the other hand, algorithmic, i.e. it is coupled with an O(n^3)-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 othei' kind of problems on claw-free graphs.

Published in:
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, null, null, 630-646
Presented at:
Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011)

 Record created 2012-10-25, last modified 2018-03-17

Download fulltext

Rate this document:

Rate this document:
(Not yet reviewed)