Proximity-Preserving Labeling Schemes and Their Applications
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 + log2 n) bit labels. For the family of all n-vertex unweighted graphs, a labeling scheme is proposed that using O(log2 n · k · n 1/k ) bit labels can provide approximate estimates to the distance, which are accurate up to a factor of √κ. 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.
Unable to display preview. Download preview PDF.
- 1.Baruch Awerbuch, Shay Kutten, and David Peleg. On buffer-economical store-and-forward deadlock prevention. In Proc. INFOCOM, pages 410–414, 1991. 36, 36, 36Google Scholar
- 2.Baruch Awerbuch and David Peleg. Routing with polynomial communication-space trade-off. SIAM J. on Discr. Math., pages 151–162, 1992. 40, 41Google Scholar
- 3.J. Bourgain. On Lipschitz embeddings of finite metric spaces in Hilbert spaces. Israel J. Math., pages 46–52, 1985. 40Google Scholar
- 6.Greg N. Frederickson and Ravi Janardan. Space-efficient message routing in c-decomposable networks. SIAM J. on Computing, pages 164–181, 1990. 32Google Scholar
- 7.Cyril Gavoille, David Peleg, Stéphane Pérennes, and Ran Raz. Distance labeling in graphs. In preparation, 1999. 40, 40Google Scholar
- 8.Y. Hassin. Private communication, 1999. 40Google Scholar
- 9.P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. 30th ACM Symp. on Theory of Computing, 1998. 40Google Scholar
- 10.Sampath Kannan, Moni Naor, and Steven Rudich. Implicit representation of graphs. In Proc. 20th ACM Symp. on Theory of Computing, pages 334–343, May 1988. 31Google Scholar
- 12.R.B. Tan. Private communication, 1997. 40Google Scholar