Maximum weight independent sets in classes related to claw-free graphs
Article Type
Research Article
Publication Title
Discrete Applied Mathematics
Abstract
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 S1,1,3-free graphs, and for S1,2,2-free graphs is unknown. We show that the MWIS problem in (S1,1,3, banner)-free graphs, and in (S1,2,2, bull)-free graphs can be solved in polynomial time. These results extend some known results in the literature.
First Page
233
Last Page
239
DOI
10.1016/j.dam.2015.02.012
Publication Date
1-10-2017
Recommended Citation
Karthick, T. and Maffray, Frédéric, "Maximum weight independent sets in classes related to claw-free graphs" (2017). Journal Articles. 2722.
https://digitalcommons.isical.ac.in/journal-articles/2722
Comments
Open Access, Bronze