Attributes | Values |
---|
rdf:type
| |
rdfs:seeAlso
| |
Description
| - 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.
- 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. (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/13:10191014!RIV14-GA0-11320___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...iv/cisloPeriodika
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216208:11320/13:10191014
|
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - Red-black graph; Polynomial space; Exact algorithm; Channel assignment problem; L(2,1)-labeling (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...odStatuVydavatele
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open...i/riv/nazevZdroje
| - Discrete Applied Mathematics
|
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...v/svazekPeriodika
| |
http://linked.open...iv/tvurceVysledku
| - Kratochvíl, Jan
- Liedloff, Mathieu
- Junosza-Szaniawski, Konstanty
- Rzazewski, Pawei
|
http://linked.open...ain/vavai/riv/wos
| |
issn
| |
number of pages
| |
http://bibframe.org/vocab/doi
| - 10.1016/j.dam.2013.03.027
|
http://localhost/t...ganizacniJednotka
| |