This paper considers informative labeling schemes for graphs. Specifically, the question introduced is whether it is possible to label the vertices of a graph with short labels in such a way that the distance between any two vertices can be inferred from inspecting their labels. A labeling scheme enjoying this property is termed a proximity-preserving labeling scheme. It is shown that for the class of n-vertex weighted trees with M-bit edge weights, there exists such a proximity-preserving labeling scheme using O(M log n + log2n) bit labels. For the family of all n-vertex unweighted graphs, a labeling scheme is proposed that using O(log2 n ċ ϰ ċ n1/ϰ) bit labels can provide approximate estimates to the distance, which are accurate up to a factor of √8ϰ. In particular, using O(log3 n) bit labels the scheme can provide estimates accurate up to a factor of √2 log n. (For weighted graphs, one of the log n factors in the label size is replaced by a factor logarithmic in the network's diameter.) In addition to their theoretical interest, proximity-preserving labeling systems seem to have some relevance in the context of communication networks. We illustrate this by proposing a potential application of our labeling schemes to efficient distributed connection setup in circuit-switched networks.
[1]
Baruch Awerbuch,et al.
Routing with Polynomial Communication-Space Trade-Off
,
1992,
SIAM J. Discret. Math..
[2]
Baruch Awerbuch,et al.
On buffer-economical store-and-forward deadlock prevention
,
1991,
IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.
[3]
Moni Naor,et al.
Implicit representation of graphs
,
1992,
STOC '88.
[4]
Piotr Indyk,et al.
Approximate nearest neighbors: towards removing the curse of dimensionality
,
1998,
STOC '98.
[5]
Melvin A. Breuer,et al.
Coding the vertexes of a graph
,
1966,
IEEE Trans. Inf. Theory.
[6]
J. Bourgain.
On lipschitz embedding of finite metric spaces in Hilbert space
,
1985
.
[7]
Melvin A. Breuer,et al.
An unexpected result in coding the vertices of a graph
,
1967
.
[8]
Greg N. Frederickson,et al.
Space-Efficient Message Routing in c-Decomposable Networks
,
1990,
SIAM J. Comput..