Proximity-preserving labeling schemes

Journal of Graph Theory

Volumn 33, Issue 3, 2000, Pages 167-176

  Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Approximate distance; Graph representations; Labeling schemes

Indexed keywords

EID: 0034423261     PISSN: 03649024     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5     Document Type: Article

References (12)

1. Baruch Awerbuch, Shay Kutten, and David Peleg, On buffer-economical store-and-forward deadlock prevention, Proc INFOCOM (1991) 410-414.
2. Melvin A. Breuer and Jon Folkman, An unexpected result on coding the vertices of a graph, J Math Anal Appl 20 (1967), 583-600.
3. J. Bourgain, On Lipschitz embeddings of finite metric spaces in Hubert spaces, Israel J Math (1985) 46-52.
4. Melvin A. Breuer, Coding the vertexes of a graph, IEEE Trans Info Theory IT 12 (1966), 148-153.
5. Greg N. Frederickson and Ravi Janardan, Space-efficient message routing in c-decomposable networks, SIAM J Comp (1990) 164-181.
6. Cyril Gavoille, David Peleg, Stéphane Pérennes, and Ran Raz, Distance labeling in graphs, unpublished manuscript, September 1999.
7. Y. Hassin, private communication, 1999.
8. P. Indyk and R. Motwani, Approximate nearest neighbors: Towards removing the curse of dimensionality, Proc 30th ACM Symp Theory Comp, 1998.
9. Michal Katz, Nir A. Katz, and David Peleg, Distance labeling schemes for well-separated graph classes, Proc. 17th Symp Theoret Aspects Comp Sci, February 2000.
10. Sampath Kannan, Moni Naor, and Steven Rudich, Implicit representation of graphs, Proc 20th ACM Symp Theory Comp, May 1988, pp. 334-343.
11. N. Linial, E. London, and Y. Rabinovich, The geometry of graphs and some of its algorithmic applications, Combin 15 (1995) 215-245.
12. D. Peleg, Proximity-preserving labeling schemes and their applications, Proc 25th Int Workshop Graph-Theoretic Concepts Comp Sci, June 1999.