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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F08%3A00206145%21RIV10-MSM-11320___
rdf:type
skos:Concept n21:Vysledek
dcterms:description
In the paper we solve long-lasting conjecture by showing that the L(p,q) labeling problem for trees is NP-complete whenever q is not a divisor of p. In the paper we solve long-lasting conjecture by showing that the L(p,q) labeling problem for trees is NP-complete whenever q is not a divisor of p.
dcterms:title
Computational complexity of the distance constrained labeling problem for trees Computational complexity of the distance constrained labeling problem for trees
skos:prefLabel
Computational complexity of the distance constrained labeling problem for trees Computational complexity of the distance constrained labeling problem for trees
skos:notation
RIV/00216208:11320/08:00206145!RIV10-MSM-11320___
n3:aktivita
n10:Z n10:P
n3:aktivity
P(1M0545), Z(MSM0021620838)
n3:dodaniDat
n5:2010
n3:domaciTvurceVysledku
n18:1123580 n18:4260686
n3:druhVysledku
n16:D
n3:duvernostUdaju
n4:S
n3:entitaPredkladatele
n15:predkladatel
n3:idSjednocenehoVysledku
360864
n3:idVysledku
RIV/00216208:11320/08:00206145
n3:jazykVysledku
n17:eng
n3:klicovaSlova
Computational; complexity; distance; constrained; labeling; problem; trees
n3:klicoveSlovo
n9:problem n9:constrained n9:Computational n9:distance n9:labeling n9:complexity n9:trees
n3:kontrolniKodProRIV
[629EE670221E]
n3:mistoKonaniAkce
Berlin
n3:mistoVydani
Berlin
n3:nazevZdroje
Automata, Languages and Programming, PT 1, proceedings
n3:obor
n22:BA
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
3
n3:projekt
n6:1M0545
n3:rokUplatneniVysledku
n5:2008
n3:tvurceVysledku
Fiala, Jiří Kratochvíl, Jan Golovach, Petr
n3:typAkce
n19:WRD
n3:wos
000258073400025
n3:zahajeniAkce
2008-01-01+01:00
n3:zamer
n8:MSM0021620838
s:numberOfPages
12
n14:hasPublisher
Springer-Verlag
n12:isbn
978-3-540-70574-1
n20:organizacniJednotka
11320