Skip to Main content Skip to Navigation
Conference papers

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 metadata

https://hal.inria.fr/inria-00463671
Contributor : Gautier Stauffer Connect in order to contact the contributor
Submitted on : Sunday, March 14, 2010 - 1:27:51 PM
Last modification on : Tuesday, October 19, 2021 - 11:05:58 PM

Identifiers

  • HAL Id : inria-00463671, version 1

Collections

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

Share

Metrics

Record views

195