Show simple item record

dc.contributor.authorMonnot, Jérôme
dc.contributor.authorMilanic, Martin
dc.subjectGraph theoryen
dc.titleThe exact weighted independent set problem in perfect graphs and related classesen
dc.typeArticle accepté pour publication ou publié
dc.contributor.editoruniversityotherUniversity of Primorska, FAMNIT, Koper;Slovénie
dc.description.abstractenThe exact weighted independent set (EWIS) problem consists in determining whether a given vertex-weighted graph contains an independent set of given weight. This problem is a generalization of two well-known problems, the NP-complete subset sum problem and the strongly NP-hard maximum weight independent set (MWIS) problem. Since the MWIS problem is polynomially solvable for some special graph classes, it is interesting to determine the complexity of this more general EWIS problem for such graph classes. We focus on the class of perfect graphs, which is one of the most general graph classes where the MWIS problem can be solved in polynomial time. It turns out that for certain subclasses of perfect graphs, the EWIS problem is solvable in pseudo-polynomial time, while on some others it remains strongly NP-complete. In particular, we show that the EWIS problem is strongly NP-complete for bipartite graphs of maximum degree three, but solvable in pseudo-polynomial time for cographs, interval graphs and chordal graphs, as well as for some other related graph classes.en
dc.relation.isversionofjnlnameElectronic notes in discrete mathematics
dc.subject.ddclabelProbablilités et mathématiques appliquéesen

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record