ESA'07 Proceedings of the 15th annual European conference on Algorithms
L(2, 1, 1)-labeling is NP-complete for trees
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Elegant distance constrained labelings of trees
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Distance three labelings of trees
Discrete Applied Mathematics
Interference-free scheduling with bounded delay in cluster-tree wireless sensor networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
On channel-discontinuity-constraint routing in wireless networks
Ad Hoc Networks
| Hi-index | 0.00 |
Given a vector (d1, d2, 驴,dt) of non increasing positive integers, and an undirected graph G = (V;E), an L(d1, d2,驴, dt)-coloring of G is a function f from the vertex set V to a set of nonnegative integers such that |f(u) - f(v)| = di, if d(u,v) = i, 1 = i = t, where d(u; v) is the distance (i.e. the minimum number of edges) between the vertices u and v. This paper presents efficient algorithms for finding optimal L(1,驴, 1)-colorings of trees and interval graphs. Moreover, efficient algorithms are also provided for finding approximate L(d1, 1,驴, 1)-colorings of trees and interval graphs, as well as approximate L(d1, d2)-colorings of unit interval graphs.