On diameters and radii of bridged graphs
Discrete Mathematics
On the closure of triangle-free graphs under substitution
Information Processing Letters
A tree representation for P4-sparse graphs
Discrete Applied Mathematics
Stability number of bull- and chair-free graphs
Discrete Applied Mathematics
Handle-rewriting hypergraph grammars
Journal of Computer and System Sciences
A decomposition for a class of &parl0;P5,P5&parr0;- free graphs
Discrete Mathematics
Discrete Mathematics
Proceedings of an international symposium on Graphs and combinatorics
On extendedP4-reducible and extendedP4-sparse graphs
Theoretical Computer Science
Weighted parameters in (P5,&Pmacr;5)-free graphs
Discrete Applied Mathematics
Graph classes: a survey
Modular decomposition and transitive orientation
Discrete Mathematics - Special issue on partial ordered sets
Efficient and practical modular decomposition
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Linear-time modular decomposition and efficient transitive orientation of comparability graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Upper bounds to the clique width of graphs
Discrete Applied Mathematics
Conic reduction of graphs for the stable set problem
Discrete Mathematics
A note on &agr;-redundant vertices in graphs
Discrete Applied Mathematics
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in 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
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
| Hi-index | 0.00 |
The Maximum Weight Stable Set (MWS) Problem is one of the fundamental algorithmic problems in graphs. It is NP-complete in general, and it has polynomial time solutions on many particular graph classes, some of them defined by forbidden subgraphs. A classical example is the result of Minty that the MWS problem is polynomially solvable for the class of claw-free graphs. The complexity of the MWS problem is unknown for the class of P5-free graphs. We give a survey on recently obtained efficient algorithms for the MWS problem for several graph classes defined by forbidden subgraphs where the algorithm avoids to recognize whether the (arbitrary) input graph is in the class i.e. the output is either a correct solution of the MWS problem or the fact that the input graph is not in the class. Such algorithms were called robust by Spinrad. The algorithms use the concepts of modular decomposition and of clique width of graphs.