Information Processing Letters
On diameters and radii of bridged graphs
Discrete Mathematics
Graph classes: a survey
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Some results on graphs without long induced paths
Information Processing Letters
On easy and hard hereditary classes of graphs with respect to the independent set problem
Discrete Applied Mathematics - Special issue on stability in graphs and related topics
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
Characterization of P6-free graphs
Discrete Applied Mathematics
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem
Theoretical Computer Science
Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs
SIAM Journal on Discrete Mathematics
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
Journal of Discrete Algorithms
Stable sets in k-colorable P5-free graphs
Information Processing Letters
Independent sets in extensions of 2K2-free graphs
Discrete Applied Mathematics
A new characterization of P6-free graphs
Discrete Applied Mathematics
| Hi-index | 0.89 |
The Maximum Weight Independent Set (MWIS) Problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. Being one of the most investigated problem on graphs, it is well known to be NP-complete and hard to approximate. Several graph classes for which MWIS can be solved in polynomial time have been introduced in the literature. This note shows that MWIS can be solved in polynomial time for (P"6,co-banner)-free graphs - where a P"6 is an induced path of 6 vertices and a co-banner is a graph with vertices a,b,c,d,e and edges ab,bc,cd,ce,de - so extending different analogous known results for other graph classes, namely, P"4-free, 2K"2-free, (P"5,co-banner)-free, and (P"6,triangle)-free graphs. The solution algorithm is based on an idea/algorithm of Farber (1989) [10], leading to a dynamic programming approach for MWIS, and needs none of the aforementioned known results as sub-procedure.