The complexity of generalized clique covering
Discrete Applied Mathematics
Information Processing Letters
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
Discrete Applied Mathematics
On the stable set problem in special P5-free 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 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
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
On atomic structure of P5-free subclasses and Maximum Weight Independent Set problem
Theoretical Computer Science
| Hi-index | 0.05 |
The Maximum Weight Independent Set (MWIS) problem on graphs with vertex weights asks for a set of pairwise nonadjacent vertices of maximum total weight. The complexity of the MWIS problem for hole-free graphs is unknown. In this paper, we first prove that the MWIS problem for (hole, dart, gem)-free graphs can be solved in O(n^3)-time. By using this result, we prove that the MWIS problem for (hole, dart)-free graphs can be solved in O(n^4)-time. Though the MWIS problem for (hole, dart, gem)-free graphs is used as a subroutine, we also give the best known time bound for the solvability of the MWIS problem in (hole, dart, gem)-free graphs.