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

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

Namespace Prefixes

PrefixIRI
n4http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://localhost/temp/predkladatel/
n15http://purl.org/net/nknouf/ns/bibtex#
n18http://linked.opendata.cz/resource/domain/vavai/projekt/
n22http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F07%3A00206159%21RIV10-MSM-11320___/
n19http://linked.opendata.cz/ontology/domain/vavai/
n11https://schema.org/
n6http://linked.opendata.cz/resource/domain/vavai/zamer/
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#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n21http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F07%3A00206159%21RIV10-MSM-11320___
rdf:type
skos:Concept n19:Vysledek
dcterms:description
We show that for chordal graphs, the problem of deciding the existence of a ($\sigma,\rho$)-dominating set performs a complete dichotomy: it is polynomial time solvable if $\sigma, \rho$ are such that every chordal graph contains at most one $(\sigma,\rho)$-dominating set, and NP-complete otherwise. The proof involves certain flavor of existentionality - we are not able to characterize such pairs $(\sigma,\rho)$ by a structural description, but at least we can provide a recursive algorithm for their recognition. We show that for chordal graphs, the problem of deciding the existence of a ($\sigma,\rho$)-dominating set performs a complete dichotomy: it is polynomial time solvable if $\sigma, \rho$ are such that every chordal graph contains at most one $(\sigma,\rho)$-dominating set, and NP-complete otherwise. The proof involves certain flavor of existentionality - we are not able to characterize such pairs $(\sigma,\rho)$ by a structural description, but at least we can provide a recursive algorithm for their recognition.
dcterms:title
Computational complexity of generalized domination: A complete dichotomy for chordal graphs Computational complexity of generalized domination: A complete dichotomy for chordal graphs
skos:prefLabel
Computational complexity of generalized domination: A complete dichotomy for chordal graphs Computational complexity of generalized domination: A complete dichotomy for chordal graphs
skos:notation
RIV/00216208:11320/07:00206159!RIV10-MSM-11320___
n3:aktivita
n14:Z n14:P
n3:aktivity
P(1M0545), Z(MSM0021620838)
n3:dodaniDat
n8:2010
n3:domaciTvurceVysledku
n22:1123580
n3:druhVysledku
n5:D
n3:duvernostUdaju
n16:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
414598
n3:idVysledku
RIV/00216208:11320/07:00206159
n3:jazykVysledku
n21:eng
n3:klicovaSlova
Computational; complexity; generalized; domination; complete; dichotomy; chordal; graphs
n3:klicoveSlovo
n13:complete n13:domination n13:chordal n13:generalized n13:complexity n13:graphs n13:Computational n13:dichotomy
n3:kontrolniKodProRIV
[08B898CF66B1]
n3:mistoKonaniAkce
Berlin
n3:mistoVydani
Berlin
n3:nazevZdroje
Graph-theoretic Concepts in Computer Science
n3:obor
n12:BD
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n18:1M0545
n3:rokUplatneniVysledku
n8:2007
n3:tvurceVysledku
Golovach, Petr Kratochvíl, Jan
n3:typAkce
n4:WRD
n3:wos
000252884200001
n3:zahajeniAkce
2007-01-01+01:00
n3:zamer
n6:MSM0021620838
s:numberOfPages
11
n15:hasPublisher
Springer-Verlag
n11:isbn
978-3-540-74838-0
n17:organizacniJednotka
11320