An Algorithmic Decomposition of Claw-free Graphs Leading to an O(n^3)-algorithm for the Weighted Stable Set Problem

Yuri Faenza 1 Gianpaolo Oriolo 1 Gautier Stauffer 2, 3
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00463671
Contributor : Gautier Stauffer <>
Submitted on : Sunday, March 14, 2010 - 1:27:51 PM
Last modification on : Thursday, January 11, 2018 - 6:22:12 AM

Identifiers

  • HAL Id : inria-00463671, version 1

Citation

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. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2011, Jan 2011, San Francisco, United States. ⟨inria-00463671⟩

Share

Metrics

Record views

154