Skip to Main content Skip to Navigation
Journal articles

Computing Maximum Stable Set for Distance-Hereditary Graphs

Olivier Cogis 1 Eric Thierry 2
1 APR - Algorithmes et Performance des Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : In this note, we provide a new and simple algorithm to compute maximum stable sets for distance-hereditary graphs. It corrects the algorithm presented by Hammer and Maffray [Discrete Appl. Math. 27 (1990) 85–99], but remains within the general greedy scheme that was suggested by Hammer and Maffray (1990).
Document type :
Journal articles
Complete list of metadata
Contributor : Christine Carvalho de Matos <>
Submitted on : Wednesday, October 11, 2006 - 7:51:29 AM
Last modification on : Saturday, September 11, 2021 - 3:18:22 AM

Links full text



Olivier Cogis, Eric Thierry. Computing Maximum Stable Set for Distance-Hereditary Graphs. Discrete Optimization, Elsevier, 2005, 2 (2), pp.185-188. ⟨10.1016/j.disopt.2005.03.004⟩. ⟨lirmm-00105342⟩



Record views