BibTeX
CSL-JSON
MLA
Harvard
An algorithmic decomposition of claw-free graphs leading to anO(n3)-algorithm for the weighted stable set problem
release_jkcj6m5rhjextbqoxsdwvv453a
by
Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer
Published
in ACM-SIAM Symposium on Discrete Algorithms by Society for Industrial and Applied Mathematics.
2011 p630-646
Archived Files and Locations
application/pdf 502.6 kB
file_x4cg43flwzhbxoarcqrpc62a64
|
infoscience.epfl.ch (web) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
Type
Stage
Date 2011-01-23
chapter
Stage
published
Date 2011-01-23
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar