20.500.12556/RUP-2747 The exact weighted independent set problem in perfect graphs and related classes The 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 pseudopolynomial 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. graf neodvisna množica popolni graf dvodelni graf graph theory complexity true true false Angleški jezik Neznan jezik Delo ni kategorizirano 2013-10-15 12:07:36 2013-10-15 12:07:36 2024-03-01 12:08:51 0000-00-00 00:00:00 2009 0 0 Str. 317-322 Vol. 35 2009 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 1571-0653 519.17 1024202836 1024190548 http://dx.doi.org/10.1016/j.endm.2009.11.052 1 https://repozitorij.upr.si/Dokument.php?lang=slv&id=2747 Inštitut Andrej Marušič 0 0 0