Exact Algorithms for L(2,1)-Labeling of Graphs

The notion of distance constrained graph labelings, motivated by the Frequency Assignment Problem, reads as follows: A mapping from the vertex set of a graph G =( V , E ) into an interval of integers {0,…, k } is an L (2,1)-labeling of G of span k if any two adjacent vertices are mapped onto integer...

Ausführliche Beschreibung