The L(2, 1)-labeling problem consists of assigning colors from the integer set 0 ...., lambda to the nodes of a graph G in such a way that nodes at a distance of at most two get different colors, while adjacent nodes get colors which are at least two apart. The aim of this problem is to minimize lambda and it is in general NP-complete. In this paper the problem of L(2, 1)-labeling unigraphs, i.e. graphs uniquely determined by their own degree sequence up to isomorphism, is addressed and a 3/2-approximate algorithm for L(2, 1)-labeling unigraphs is designed. This algorithm runs in 0(n) time, improving the time of the algorithm based on the greedy technique, requiring 0(m) time, that may be near to Theta (n(2)) for unigraphs. (C) 2011 Elsevier B.V. All rights reserved.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
|Titolo:||The L(2,1)-labeling of unigraphs|
|Data di pubblicazione:||2011|
|Appartiene alla tipologia:||01a Articolo in rivista|