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]

@inproceedings{FaenzaOS11,
  title = {An algorithmic decomposition of claw-free graphs leading to an O(n:::3:::)-algorithm for the weighted stable set problem},
  author = {Yuri Faenza and Gianpaolo Oriolo and Gautier Stauffer},
  year = {2011},
  url = {http://www.siam.org/proceedings/soda/2011/SODA11_049_faenzay.pdf},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/FaenzaOS11},
  cites = {0},
  citedby = {0},
  pages = {630-646},
  booktitle = {Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, San Francisco, California, USA, January 23-25, 2011},
  editor = {Dana Randall},
  publisher = {SIAM},
}