Approximate Distance Labeling Schemes

In this paper we show how to label the nodes of every interval graphs of diameter D with integers of size [log-D] + 1 bits so that the distance up to an additive factor 1 between two distinct nodes can be computed in constant time from their labels only. The technique we propose may be generalized to prove additive O(1)-approximate distance labeling schemes for more general class of graphs including various intersecting classes of graphs, like chordal and circle graphs.