Lupa

Izpis gradiva Pomoč

A- | A+ | Natisni
Naslov:The exact weighted independent set problem in perfect graphs and related classes
Avtorji:ID Milanič, Martin (Avtor)
ID Monnot, Jérôme (Avtor)
Datoteke:URL http://dx.doi.org/10.1016/j.endm.2009.11.052
 
Jezik:Angleški jezik
Vrsta gradiva:Delo ni kategorizirano
Tipologija:1.08 - Objavljeni znanstveni prispevek na konferenci
Organizacija:IAM - Inštitut Andrej Marušič
Opis: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.
Ključne besede:graf, neodvisna množica, popolni graf, dvodelni graf
Leto izida:2009
Št. strani:Str. 317-322
Številčenje:Vol. 35
PID:20.500.12556/RUP-2747 Povezava se odpre v novem oknu
ISSN:1571-0653
UDK:519.17
COBISS.SI-ID:1024190548 Povezava se odpre v novem oknu
Datum objave v RUP:15.10.2013
Število ogledov:3411
Število prenosov:117
Metapodatki:XML DC-XML DC-RDF
:
Kopiraj citat
  
Skupna ocena:(0 glasov)
Vaša ocena:Ocenjevanje je dovoljeno samo prijavljenim uporabnikom.
Objavi na:Bookmark and Share


Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše podrobnosti ali sproži prenos.

Sekundarni jezik

Jezik:Neznan jezik
Ključne besede:graph theory, complexity


Komentarji

Dodaj komentar

Za komentiranje se morate prijaviti.

Komentarji (0)
0 - 0 / 0
 
Ni komentarjev!

Nazaj
Logotipi partnerjev Univerza v Mariboru Univerza v Ljubljani Univerza na Primorskem Univerza v Novi Gorici