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  chapter
Stage   published
Date   2011-01-23
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 3b4ef239-dd8d-4a86-a470-4132daae4687
API URL: JSON