Maximum weight independent sets in (S1,1,3, bull)-free graphs
Document Type
Conference Article
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
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 MWIS problem is well known to be NP-complete in general, even under substantial restrictions. The computational complexity of the MWIS problem for S1,1,3-free graphs is unknown. In this note, we give a proof for the solvability of the MWIS problem for (S1,1,3, bull)-free graphs in polynomial time. Here, an S1,1,3 is the graph with vertices v1, v2, v3, v4, v5, v6 and edges v1v2, v2v3, v3v4, v4v5, v4v6, and the bull is the graph with vertices v1, v2, v3, v4, v5 and edges v1v2, v2v3, v3v4, v2v5, v3v5.
First Page
385
Last Page
392
DOI
10.1007/978-3-319-42634-1_31
Publication Date
1-1-2016
Recommended Citation
Karthick, T. and Maffray, Frédéric, "Maximum weight independent sets in (S1,1,3, bull)-free graphs" (2016). Conference Articles. 746.
https://digitalcommons.isical.ac.in/conf-articles/746
