This HTML5 document contains 51 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n11http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://localhost/temp/predkladatel/
n21http://purl.org/net/nknouf/ns/bibtex#
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n10http://linked.opendata.cz/resource/domain/vavai/projekt/
n17http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F08%3A00100095%21RIV09-MSM-11320___/
n9http://linked.opendata.cz/ontology/domain/vavai/
n19http://linked.opendata.cz/resource/domain/vavai/zamer/
n7https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F08%3A00100095%21RIV09-MSM-11320___
rdf:type
n9:Vysledek skos:Concept
dcterms:description
Ukazujeme, že pro každé číslo k je otázka existence (sigma,ro)-dominující množiny v daném k=degenerovaném grafu buď polynomiální nebo NP-úplná, a podáváme úplnou charakterizaci těchto případů pro konečné množiny sigma a ro. We show that for every k, the problem of existence of a (sigma,rho)-dominating set performs a complete dichotomy when restricted to k-degenerate graphs, and we fully characterize the polynomial and NP-complete instances. It is further shown that the problem is polynomial time solvable if sigma, rho are such that every k-degenerate graph contains at most one (sigma, rho)-dominating set, and NP-complete otherwise. This relates to the concept of ambivalent graphs previously introduced for chordal graphs. We show that for every k, the problem of existence of a (sigma,rho)-dominating set performs a complete dichotomy when restricted to k-degenerate graphs, and we fully characterize the polynomial and NP-complete instances. It is further shown that the problem is polynomial time solvable if sigma, rho are such that every k-degenerate graph contains at most one (sigma, rho)-dominating set, and NP-complete otherwise. This relates to the concept of ambivalent graphs previously introduced for chordal graphs.
dcterms:title
Generalized domination in degenerate graphs: A complete dichotomy of computational complexity Generalized domination in degenerate graphs: A complete dichotomy of computational complexity Zobecněná dominace v degenerovaných grafech: Úplná dichotomie výpočetní složitosti
skos:prefLabel
Generalized domination in degenerate graphs: A complete dichotomy of computational complexity Zobecněná dominace v degenerovaných grafech: Úplná dichotomie výpočetní složitosti Generalized domination in degenerate graphs: A complete dichotomy of computational complexity
skos:notation
RIV/00216208:11320/08:00100095!RIV09-MSM-11320___
n3:aktivita
n4:Z n4:P
n3:aktivity
P(1M0545), Z(MSM0021620838)
n3:dodaniDat
n6:2009
n3:domaciTvurceVysledku
n14:1123580
n3:druhVysledku
n12:D
n3:duvernostUdaju
n20:S
n3:entitaPredkladatele
n17:predkladatel
n3:idSjednocenehoVysledku
369052
n3:idVysledku
RIV/00216208:11320/08:00100095
n3:jazykVysledku
n15:eng
n3:klicovaSlova
Generalized; domination; degenerate; graphs; complete; dichotomy; computational; complexity
n3:klicoveSlovo
n8:graphs n8:complexity n8:Generalized n8:dichotomy n8:degenerate n8:computational n8:domination n8:complete
n3:kontrolniKodProRIV
[0D0A4D02D043]
n3:mistoKonaniAkce
Berlin
n3:mistoVydani
Berlin
n3:nazevZdroje
Theory and Applications of Models of Computation, Proceedings
n3:obor
n16:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n10:1M0545
n3:rokUplatneniVysledku
n6:2008
n3:tvurceVysledku
Golovach, Petr Kratochvíl, Jan
n3:typAkce
n11:WRD
n3:wos
000255239500016
n3:zahajeniAkce
2008-01-01+01:00
n3:zamer
n19:MSM0021620838
s:numberOfPages
10
n21:hasPublisher
Springer-Verlag
n7:isbn
978-3-540-79227-7
n22:organizacniJednotka
11320