UP - logo
University of Primorska University Library - all departments (UPUK)
  • The exact weighted independent set problem in perfect graphs and related classes [Elektronski vir]
    Milanič, Martin, 1980- ; Monnot, Jérôme
    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.
    Source: The V Latin-American Algorithms, Graphs, and Optimization Symposium [Elektronski vir] : Gramado, Brazil, 03-07 November 2009 (Vol. 35, 2009, Str. 317-322)
    Type of material - conference contribution ; adult, serious
    Publish date - 2009
    Language - english
    COBISS.SI-ID - 1024190548

    Link(s):

    http://dx.doi.org/10.1016/j.endm.2009.11.052
    Repository of University of Primorska - RUP
    DOI

Shelf entry