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/
dctermshttp://purl.org/dc/terms/
n17http://purl.org/net/nknouf/ns/bibtex#
n11http://localhost/temp/predkladatel/
n20http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/resource/domain/vavai/projekt/
n21http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/zamer/
n14https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
n13http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F05%3A00206177%21RIV10-MSM-11320___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n22http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F05%3A00206177%21RIV10-MSM-11320___
rdf:type
n21:Vysledek skos:Concept
dcterms:description
The paper considers distance constrained labelings of graphs of bounded treewidth. In particular we prove that L(2,1) labeling is NP-hard for series-parallel graphs, i.e., graphs of treewidth two. The paper considers distance constrained labelings of graphs of bounded treewidth. In particular we prove that L(2,1) labeling is NP-hard for series-parallel graphs, i.e., graphs of treewidth two.
dcterms:title
Distance constrained labelings of graphs of bounded treewidth Distance constrained labelings of graphs of bounded treewidth
skos:prefLabel
Distance constrained labelings of graphs of bounded treewidth Distance constrained labelings of graphs of bounded treewidth
skos:notation
RIV/00216208:11320/05:00206177!RIV10-MSM-11320___
n5:aktivita
n12:P n12:Z
n5:aktivity
P(1M0545), P(ME 525), Z(MSM0021620838)
n5:dodaniDat
n9:2010
n5:domaciTvurceVysledku
n20:4260686 n20:1123580
n5:druhVysledku
n22:D
n5:duvernostUdaju
n18:S
n5:entitaPredkladatele
n13:predkladatel
n5:idSjednocenehoVysledku
518305
n5:idVysledku
RIV/00216208:11320/05:00206177
n5:jazykVysledku
n6:eng
n5:klicovaSlova
Distance; constrained; labelings; graphs; bounded; treewidth
n5:klicoveSlovo
n7:bounded n7:Distance n7:labelings n7:constrained n7:treewidth n7:graphs
n5:kontrolniKodProRIV
[B098F85FBA96]
n5:mistoKonaniAkce
Berlin
n5:mistoVydani
Berlin
n5:nazevZdroje
Automata, Languages and Programming, proceedings
n5:obor
n15:BA
n5:pocetDomacichTvurcuVysledku
2
n5:pocetTvurcuVysledku
3
n5:projekt
n8:ME%20525 n8:1M0545
n5:rokUplatneniVysledku
n9:2005
n5:tvurceVysledku
Kratochvíl, Jan Fiala, Jiří Golovach, Petr A.
n5:typAkce
n19:WRD
n5:wos
000230880500030
n5:zahajeniAkce
2005-01-01+01:00
n5:zamer
n16:MSM0021620838
s:numberOfPages
13
n17:hasPublisher
Springer-Verlag
n14:isbn
3-540-27580-0
n11:organizacniJednotka
11320