Recognizing P4-sparse graphs in linear time
SIAM Journal on Computing
Stability number of bull- and chair-free graphs
Discrete Applied Mathematics
Linear time optimization for P 4-sparse 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
Conic reduction of graphs for the stable set problem
Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Linear Algorithm for Modular Decomposition
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Structure and stability number of chair-, co-P- and gem-free graphs revisited
Information Processing Letters
Stability number of bull- and chair-free graphs revisited
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
Theoretical Computer Science
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
Recent developments on graphs of bounded clique-width
Discrete Applied Mathematics
New applications of clique separator decomposition for the maximum weight stable set problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Hi-index | 0.89 |
Modular decomposition of graphs is a powerful tool for designing efficient algorithms for problems on graphs such as Maximum Weight Stable Set (MWS) and Maximum Weight Clique. Using this tool we obtain O(n ċ m) time algorithms for MWS on chair- and xbull-free graphs which considerably extend an earlier result on bull- and chair-free graphs by De Simone and Sassano (the chair is the graph with vertices a, b, c, d, e and edges ab, bc, cd, be, and the xbull is the graph with vertices a, b, c, d, e, f and edges ab, bc, cd, de, bf, cf). Moreover, our algorithm is robust in the sense that we do not have to check in advance whether the input graphs are indeed chair-and xbull-free.