On diameters and radii of bridged graphs
Discrete Mathematics
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
Discrete Applied Mathematics
Polynomial algorithms for the maximum stable set problem on particular classes of P5-free graphs
Information Processing Letters
Graph classes: a survey
Data Mining with optimized two-dimensional association rules
ACM Transactions on Database Systems (TODS)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the stable set problem in special P5-free graphs
Discrete Applied Mathematics
On variations of P4-sparse graphs
Discrete Applied Mathematics
On the structure and stability number of P5- and co-chair-free graphs
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
New Graph Classes of Bounded Clique-Width
Theory of Computing Systems
On algorithms for (P5,gem)-free graphs
Theoretical Computer Science - Graph colorings
New applications of clique separator decomposition for the Maximum Weight Stable Set problem
Theoretical Computer Science
On clique separators, nearly chordal graphs, and 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
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
Independent Sets of Maximum Weight in Apple-Free Graphs
SIAM Journal on Discrete Mathematics
Maximum Weight Independent Sets in hole- and co-chair-free graphs
Information Processing Letters
Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences
Discrete Applied Mathematics
Maximum weight independent sets in hole- and dart-free graphs
Discrete Applied Mathematics
| Hi-index | 5.23 |
Graph decompositions play a crucial role in structural graph theory and in designing efficient graph algorithms. Among them, clique separator decomposition (a decomposition tree of the graph whose leaves have no clique separator (so-called atoms)) used by Tarjan for solving various optimization problems recently received much attention. In this note, we first derive the atomic structure of two subclasses of P"5-free graphs, where P"5 is a chordless path on five vertices. These results enable us to provide efficient solutions for the Maximum Weight Independent Set problem in these classes of graphs.