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

Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer. An algorithmic decomposition of claw-free graphs leading to an O(n:::3:::)-algorithm for the weighted stable set problem. In Dana Randall, editor, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011. pages 630-646, SIAM, 2011. [doi]

Abstract

Abstract is missing.