Note: Computing maximum stable sets for distance-hereditary graphs

Authors:
O. Cogis;E. Thierry
Affiliations:
LIRMM, 161 rue Ada, 34392 Montpellier Cedex 5, France;LIP, ENS Lyon, 46 allée d'Italie, 69007 Lyon, France
Venue:
Discrete Optimization
Year:
2005

Citing 9
Cited 1

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Graph classes: a survey

Graph classes: a survey
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs

Theoretical Computer Science
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs

ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On the Clique-Width of Perfect Graph Classes

WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
How to Solve NP-hard Graph Problems on Clique-Width Bounded Graphs in Polynomial Time

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Dynamic Programming on Distance-Hereditary Graphs

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation

A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs

Computing

Quantified Score

Hi-index	0.00

Visualization

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).