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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F10%3A10051725%21RIV11-MSM-11320___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
An L(p(1), p(2), p(3))-labeling of a graph G with span lambda is a mapping f that assigns each vertex u of G an integer label 0 {= f(u) {= lambda such that vertical bar f(u) - f(v)vertical bar }= p(i) whenever vertices u and v are of distance i for i is an element of {1, 2, 3}. We show that testing whether a given graph has an L(2, 1, 1)-labeling with some given span lambda is NP-complete even for the class of trees. An L(p(1), p(2), p(3))-labeling of a graph G with span lambda is a mapping f that assigns each vertex u of G an integer label 0 {= f(u) {= lambda such that vertical bar f(u) - f(v)vertical bar }= p(i) whenever vertices u and v are of distance i for i is an element of {1, 2, 3}. We show that testing whether a given graph has an L(2, 1, 1)-labeling with some given span lambda is NP-complete even for the class of trees.
dcterms:title
L(2,1,1)-Labeling Is NP-Complete for Trees L(2,1,1)-Labeling Is NP-Complete for Trees
skos:prefLabel
L(2,1,1)-Labeling Is NP-Complete for Trees L(2,1,1)-Labeling Is NP-Complete for Trees
skos:notation
RIV/00216208:11320/10:10051725!RIV11-MSM-11320___
n3:aktivita
n12:Z n12:S
n3:aktivity
S, Z(MSM0021620838)
n3:dodaniDat
n10:2011
n3:domaciTvurceVysledku
n8:2673177
n3:druhVysledku
n20:D
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n6:predkladatel
n3:idSjednocenehoVysledku
269082
n3:idVysledku
RIV/00216208:11320/10:10051725
n3:jazykVysledku
n5:eng
n3:klicovaSlova
TREEWIDTH; GRAPHS; DISTANCE CONSTRAINED LABELINGS
n3:klicoveSlovo
n4:DISTANCE%20CONSTRAINED%20LABELINGS n4:GRAPHS n4:TREEWIDTH
n3:kontrolniKodProRIV
[A4E83ECD3776]
n3:mistoKonaniAkce
Praha
n3:mistoVydani
Berlin
n3:nazevZdroje
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS
n3:obor
n19:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
3
n3:rokUplatneniVysledku
n10:2010
n3:tvurceVysledku
Lidický, Bernard Paulusma, Daniël Golovach, Petr A
n3:typAkce
n13:WRD
n3:wos
000279560400019
n3:zahajeniAkce
2010-06-07+02:00
n3:zamer
n16:MSM0021620838
s:issn
0302-9743
s:numberOfPages
11
n21:hasPublisher
Springer-Verlag
n18:isbn
978-3-642-13561-3
n17:organizacniJednotka
11320