Determining the L(2,1)-span in polynomial space

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F13%3A10191014" target="_blank" >RIV/00216208:11320/13:10191014 - isvavai.cz</a>
Výsledek na webu
<a href="http://dx.doi.org/10.1016/j.dam.2013.03.027" target="_blank" >http://dx.doi.org/10.1016/j.dam.2013.03.027</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.dam.2013.03.027" target="_blank" >10.1016/j.dam.2013.03.027</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Determining the L(2,1)-span in polynomial space
Popis výsledku v původním jazyce
A k-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 0*(7.4922(n)) and polynomial space. Then we adapt our method to obtain a faster algorithm for k-L(2, 1)-labeling, where k is a small positive constant. Moreover, a new interesting extremal graph theoretic problem is defined and solved.
Název v anglickém jazyce
Determining the L(2,1)-span in polynomial space
Popis výsledku anglicky
A k-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 0*(7.4922(n)) and polynomial space. Then we adapt our method to obtain a faster algorithm for k-L(2, 1)-labeling, where k is a small positive constant. Moreover, a new interesting extremal graph theoretic problem is defined and solved.

Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
IN - Informatika
OECD FORD obor
—

Projekt
<a href="/cs/project/GBP202%2F12%2FG061" target="_blank" >GBP202/12/G061: Centrum excelence - Institut teoretické informatiky (CE-ITI)</a><br>
Návaznosti
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění
2013
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)