{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:05:25Z","timestamp":1769915125579,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540667315","type":"print"},{"value":"9783540467847","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_5","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"30-41","source":"Crossref","is-referenced-by-count":46,"title":["Proximity-Preserving Labeling Schemes and Their Applications"],"prefix":"10.1007","author":[{"given":"David","family":"Peleg","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Baruch Awerbuch, Shay Kutten, and David Peleg. On buffer-economical store-and-forward deadlock prevention. In Proc. INFOCOM, pages 410\u2013414, 1991. 36, 36, 36","DOI":"10.1109\/INFCOM.1991.147532"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Baruch Awerbuch and David Peleg. Routing with polynomial communication-space trade-off. SIAM J. on Discr. Math., pages 151\u2013162, 1992. 40, 41","DOI":"10.1137\/0405013"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"J. Bourgain. On Lipschitz embeddings of finite metric spaces in Hilbert spaces. Israel J. Math., pages 46\u201352, 1985. 40","DOI":"10.1007\/BF02776078"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/TIT.1966.1053860","volume":"IT-12","author":"M. A. Breuer","year":"1966","unstructured":"Melvin A. Breuer. Coding the vertexes of a graph. IEEE Trans. on Information Theory, IT-12:148\u2013153, 1966. 31","journal-title":"IEEE Trans. on Information Theory"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0022-247X(67)90082-0","volume":"20","author":"M. A. Breuer","year":"1967","unstructured":"Melvin A. Breuer and Jon Folkman. An unexpected result on coding the vertices of a graph. J. of Mathematical Analysis and Applications, 20:583\u2013600, 1967. 31, 31","journal-title":"J. of Mathematical Analysis and Applications"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Greg N. Frederickson and Ravi Janardan. Space-efficient message routing in c-decomposable networks. SIAM J. on Computing, pages 164\u2013181, 1990. 32","DOI":"10.1137\/0219011"},{"key":"5_CR7","unstructured":"Cyril Gavoille, David Peleg, St\u00e9phane P\u00e9rennes, and Ran Raz. Distance labeling in graphs. In preparation, 1999. 40, 40"},{"key":"5_CR8","unstructured":"Y. Hassin. Private communication, 1999. 40"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"P. Indyk and R. Motwani. Approximate nearest neighbors: towards removing the curse of dimensionality. In Proc. 30th ACM Symp. on Theory of Computing, 1998. 40","DOI":"10.1145\/276698.276876"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Sampath Kannan, Moni Naor, and Steven Rudich. Implicit representation of graphs. In Proc. 20th ACM Symp. on Theory of Computing, pages 334\u2013343, May 1988. 31","DOI":"10.1145\/62212.62244"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01200757","volume":"15","author":"N. Linial","year":"1995","unstructured":"N. Linial, E. London, and Y. Rabinovich. The geometry of graphs and some of its algorithmic applications. Combinatorica, 15:215\u2013245, 1995. 40, 40","journal-title":"Combinatorica"},{"key":"5_CR12","unstructured":"R.B. Tan. Private communication, 1997. 40"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46784-X_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T23:38:06Z","timestamp":1556321886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}