A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Proximity-Preserving Labeling Schemes and Their Applications
[chapter]

1999
*
Lecture Notes in Computer Science
*

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

doi:10.1007/3-540-46784-x_5
fatcat:foltucx5ejdodb4enkkgbyjsyq