Computing maximum stable sets for distance-hereditary graphs

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). © 2005 Elsevier B.V. All rights reserved.