An Algorithmic Decomposition of Claw-free Graphs Leading to an O(n^3)-algorithm for the Weighted Stable Set Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

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

Domains

Computer Science [cs]

Gautier Stauffer  : Connect in order to contact the contributor

https://inria.hal.science/inria-00463671

Submitted on : Sunday, March 14, 2010-1:27:51 PM

Last modification on : Thursday, April 4, 2024-3:08:08 AM

No file

Dates and versions

inria-00463671 , version 1 (14-03-2010)

Identifiers

  • HAL Id : inria-00463671 , version 1

Cite

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⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS INRIA IMB INRIA2
63 View
0 Download

Share

Gmail Facebook X LinkedIn More