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

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

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n6http://localhost/temp/predkladatel/
n14http://linked.opendata.cz/resource/domain/vavai/projekt/
n13http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n20http://linked.opendata.cz/resource/domain/vavai/subjekt/
n15http://linked.opendata.cz/ontology/domain/vavai/
shttp://schema.org/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
skoshttp://www.w3.org/2004/02/skos/core#
n19http://bibframe.org/vocab/
n7http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216208%3A11320%2F12%3A10131333%21RIV13-GA0-11320___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n8http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216208%3A11320%2F12%3A10131333%21RIV13-GA0-11320___
rdf:type
skos:Concept n15:Vysledek
dcterms:description
An L(2,1)-labeling of a graph is a mapping from its vertex set into a set of integers {0,..,k} such that adjacent vertices get labels that differ by at least 2 and vertices in distance 2 get different labels. The main result of the paper is an algorithm finding an optimal L(2,1)-labeling of a graph (i.e. an L(2,1)-labeling in which the largest label is the least possible) in time O *(7.4922^n ) and polynomial space. Moreover, a new interesting extremal graph theoretic problem is defined and solved. An L(2,1)-labeling of a graph is a mapping from its vertex set into a set of integers {0,..,k} such that adjacent vertices get labels that differ by at least 2 and vertices in distance 2 get different labels. The main result of the paper is an algorithm finding an optimal L(2,1)-labeling of a graph (i.e. an L(2,1)-labeling in which the largest label is the least possible) in time O *(7.4922^n ) and polynomial space. Moreover, a new interesting extremal graph theoretic problem is defined and solved.
dcterms:title
Determining the L(2, 1)-Span in Polynomial Space Determining the L(2, 1)-Span in Polynomial Space
skos:prefLabel
Determining the L(2, 1)-Span in Polynomial Space Determining the L(2, 1)-Span in Polynomial Space
skos:notation
RIV/00216208:11320/12:10131333!RIV13-GA0-11320___
n15:predkladatel
n20:orjk%3A11320
n4:aktivita
n16:P n16:I
n4:aktivity
I, P(GBP202/12/G061)
n4:cisloPeriodika
Summer
n4:dodaniDat
n9:2013
n4:domaciTvurceVysledku
n13:1123580
n4:druhVysledku
n12:J
n4:duvernostUdaju
n8:S
n4:entitaPredkladatele
n7:predkladatel
n4:idSjednocenehoVysledku
130679
n4:idVysledku
RIV/00216208:11320/12:10131333
n4:jazykVysledku
n17:eng
n4:klicovaSlova
algorithm; computational complexity; coloring; frequency assignment; graph
n4:klicoveSlovo
n5:algorithm n5:frequency%20assignment n5:computational%20complexity n5:graph n5:coloring
n4:kodStatuVydavatele
DE - Spolková republika Německo
n4:kontrolniKodProRIV
[00B46D4F9837]
n4:nazevZdroje
Lecture Notes in Computer Science
n4:obor
n18:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
4
n4:projekt
n14:GBP202%2F12%2FG061
n4:rokUplatneniVysledku
n9:2012
n4:svazekPeriodika
7551
n4:tvurceVysledku
Liedloff, Mathieu Junosza-Szaniawski, Konstanty Kratochvíl, Jan Rzazewski, Pawel
s:issn
0302-9743
s:numberOfPages
12
n19:doi
10.1007/978-3-642-34611-8_15
n6:organizacniJednotka
11320