Independent sets in classes related to chair-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. MWIS is known to be NP-complete in general, but solvable in polynomial time in classes of Si,j,k-free graphs, where Si,j,k is the graph consisting of three induced paths of lengths i, j, k with a common initial vertex. The complexity of the MWIS problem for S1,2,2-free graphs, and for S1,1,3-free graphs are open. In this paper, we show that the MWIS problem can solved in polynomial time for (S1,2,2, S1,1,3, co-chair)-free graphs, by analyzing the structure of the subclasses of this class of graphs. This extends some known results in the literature.
First Page
224
Last Page
232
DOI
10.1007/978-3-319-29221-2_19
Publication Date
1-1-2016
Recommended Citation
Karthick, T., "Independent sets in classes related to chair-free graphs" (2016). Conference Articles. 729.
https://digitalcommons.isical.ac.in/conf-articles/729
