About: Determining the L(2, 1)-Span in Polynomial Space

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Determining the L(2, 1)-Span in Polynomial Space Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
Title	Determining the L(2, 1)-Span in Polynomial Space Determining the L(2, 1)-Span in Polynomial Space (en)
skos:prefLabel	Determining the L(2, 1)-Span in Polynomial Space Determining the L(2, 1)-Span in Polynomial Space (en)
skos:notation	RIV/00216208:11320/12:10131333!RIV13-GA0-11320___
http://linked.open...avai/riv/aktivita	I P
http://linked.open...avai/riv/aktivity	I, P(GBP202/12/G061)
http://linked.open...iv/cisloPeriodika	Summer
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Kratochvíl, Jan
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Univerzita Karlova v Praze / Matematicko-fyzikální fakulta
http://linked.open...dnocenehoVysledku	130679
http://linked.open...ai/riv/idVysledku	RIV/00216208:11320/12:10131333
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	algorithm; computational complexity; coloring; frequency assignment; graph (en)
http://linked.open.../riv/klicoveSlovo	graph coloring computational complexity frequency assignment algorithm
http://linked.open...odStatuVydavatele	DE - Spolková republika Německo
http://linked.open...ontrolniKodProRIV	[00B46D4F9837]
http://linked.open...i/riv/nazevZdroje	Lecture Notes in Computer Science
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	4 (xsd:int)
http://linked.open...vavai/riv/projekt	Center of excellence - Institute for theoretical computer science (CE-ITI)
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	7551
http://linked.open...iv/tvurceVysledku	Kratochvíl, Jan Liedloff, Mathieu Junosza-Szaniawski, Konstanty Rzazewski, Pawel
issn	0302-9743
number of pages	12 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-642-34611-8_15
http://localhost/t...ganizacniJednotka	11320

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 47 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software