{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:44Z","timestamp":1760202524659},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309352"},{"type":"electronic","value":"9783540324263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11602613_106","type":"book-chapter","created":{"date-parts":[[2005,12,2]],"date-time":"2005-12-02T08:24:24Z","timestamp":1133511864000},"page":"1071-1079","source":"Crossref","is-referenced-by-count":21,"title":["Distance Labeling in Hyperbolic Graphs"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Ly","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Agarwala, R., Bafna, V., Farach, M., Paterson, M., Thorup, M.: On the approximability of numerical taxonomy (fitting distances by tree metrics). In: 7th Symposium on Discrete Algorithms (SODA), January 1996, pp. 365\u2013372. ACM-SIAM (1996)","key":"106_CR1"},{"unstructured":"Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. In: 14th Symposium on Discrete Algorithms (SODA), January 2003, pp. 689\u2013698. ACM-SIAM (2003)","key":"106_CR2"},{"issue":"2","key":"106_CR3","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/S0895480100380902","volume":"16","author":"H.-J. Bandelt","year":"2003","unstructured":"Bandelt, H.-J., Chepoi, V.D.: 1-hyperbolic graphs. SIAM Journal on Discrete Mathematics\u00a016(2), 323\u2013334 (2003)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"106_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0012-365X(94)00052-K","volume":"145","author":"H.-J. Bandelt","year":"1995","unstructured":"Bandelt, H.-J., Henkmann, A., Nicolai, F.: Powers of distance-hereditary graphs. Discrete Mathematics\u00a0145, 37\u201360 (1995)","journal-title":"Discrete Mathematics"},{"key":"106_CR5","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.-J. Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. Journal of Combinatorial Theory, Series B\u00a041, 182\u2013208 (1986)","journal-title":"Journal of Combinatorial Theory, Series B"},{"unstructured":"Bazzaro, F., Gavoille, C.: Localized and compact data-structure for comparability graphs. Research Report RR-1343-05, LaBRI, University of Bordeaux\u00a01, 351, cours de la Lib\u00e9ration, 33405 Talence Cedex, France (February 2005)","key":"106_CR6"},{"issue":"1","key":"106_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s00026-001-8007-7","volume":"5","author":"G. Brinkmann","year":"2001","unstructured":"Brinkmann, G., Koolen, J.H., Moulton, V.: On the hyperbolicity of chordal graphs. Annals of Combinatorics\u00a05(1), 61\u201365 (2001)","journal-title":"Annals of Combinatorics"},{"unstructured":"Buneman, P.: The recovery of trees from measures of dissimilarity. In: Mathematics in Archaeological and Historical Sciences, pp. 387\u2013395 (1971)","key":"106_CR8"},{"doi-asserted-by":"crossref","unstructured":"Chepoi, V.D., Dragan, F.F., Vaxes, Y.: Distance and routing labeling schemes for non-positively curved plane graphs. Journal of Algorithms (2005) (to appear)","key":"106_CR9","DOI":"10.1016\/j.jalgor.2004.07.011"},{"key":"106_CR10","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0166-218X(02)00421-3","volume":"131","author":"B. Courcelle","year":"2003","unstructured":"Courcelle, B., Vanicat, R.: Query efficient implementation of graphs of bounded clique-width. Discrete Applied Mathematics\u00a0131, 129\u2013150 (2003)","journal-title":"Discrete Applied Mathematics"},{"unstructured":"Dourisboure, Y., Gavoille, C.: Tree-decomposition of graphs with small diameter bags. In: Fila, J. (ed.) 2nd European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), September 2003, pp. 100\u2013104 (2003)","key":"106_CR11"},{"key":"106_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/aama.1996.0503","volume":"19","author":"A.W.M. Dress","year":"1997","unstructured":"Dress, A.W.M., Moulton, V., Steel, M.A.: Trees, taxonomy, and strongly compatible multi-state characters. Advances in Applied Mathematics\u00a019, 1\u201330 (1997)","journal-title":"Advances in Applied Mathematics"},{"key":"106_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/eujc.1996.0015","volume":"17","author":"A.W.M. Dress","year":"1996","unstructured":"Dress, A.W.M., Moulton, V., Terhalle, W.: T-theory: an overview. European Journal of Combinatorics\u00a017, 161\u2013175 (1996)","journal-title":"European Journal of Combinatorics"},{"doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, P.: Extremal problems in graph theory. In: Publ. House Cszechoslovak Acad. Sci., Prague, pp. 29\u201336 (1964)","key":"106_CR14","DOI":"10.4064\/cm-13-2-251-254"},{"key":"106_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/3-540-44676-1_40","volume-title":"Algorithms - ESA 2001","author":"C. Gavoille","year":"2001","unstructured":"Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 476\u2013488. Springer, Heidelberg (2001)"},{"issue":"1-3","key":"106_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0012-365X(03)00232-2","volume":"273","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Paul, C.: Distance labeling scheme and split decomposition. Discrete Mathematics\u00a0273(1-3), 115\u2013130 (2003)","journal-title":"Discrete Mathematics"},{"key":"106_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-540-39658-1_25","volume-title":"Algorithms - ESA 2003","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Paul, C.: Optimal distance labeling schemes for interval and circular-arc graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 254\u2013265. Springer, Heidelberg (2003)"},{"key":"106_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s00446-002-0073-5","volume":"16","author":"C. Gavoille","year":"2003","unstructured":"Gavoille, C., Peleg, D.: Compact and localized distributed data structures. Journal of Distributed Computing\u00a016, 111\u2013120 (2003) PODC 20-Year Special Issue","journal-title":"Journal of Distributed Computing"},{"issue":"1","key":"106_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.jalgor.2004.05.002","volume":"53","author":"C. Gavoille","year":"2004","unstructured":"Gavoille, C., Peleg, D., P\u00e9renn\u00e8s, S., Raz, R.: Distance labeling in graphs. Journal of Algorithms\u00a053(1), 85\u2013112 (2004)","journal-title":"Journal of Algorithms"},{"key":"106_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9167-8","volume-title":"Sur les Groupes Hyperboliques d\u2019apr\u00e8s Mikhael Gromov","author":"E. Ghys","year":"1990","unstructured":"Ghys, E., de La Harpe, P.: Sur les Groupes Hyperboliques d\u2019apr\u00e8s Mikhael Gromov. Birkh\u00e4user, Basel (1990)"},{"key":"106_CR21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/978-1-4613-9586-7_3","volume":"8","author":"M. Gromov","year":"1987","unstructured":"Gromov, M.: Hyperbolic groups. Essays in Group Theory, Mathematical Sciences Research Institute Publications\u00a08, 75\u2013263 (1987)","journal-title":"Essays in Group Theory, Mathematical Sciences Research Institute Publications"},{"key":"106_CR22","first-page":"534","volume-title":"44 th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A. Gupta","year":"2003","unstructured":"Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: 44 th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 534\u2013543. IEEE Computer Society Press, Los Alamitos (2003)"},{"issue":"2","key":"106_CR23","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1137\/S0097539702409927","volume":"34","author":"A. Gupta","year":"2005","unstructured":"Gupta, A., Kumar, A., Rastogi, R.: Traveling with a pez dispenser (or, routing issues in mpls). SIAM Journal on Computing\u00a034(2), 453\u2013474 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"106_CR24","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0095-8956(79)90069-8","volume":"27","author":"E. Howorka","year":"1979","unstructured":"Howorka, E.: On metric properties of certain clique graphs. Journal of Combinatorial Theory, Series B\u00a027, 67\u201374 (1979)","journal-title":"Journal of Combinatorial Theory, Series B"},{"unstructured":"Kaplan, H., Milo, T.: Parent and ancestor queries using a compact index. In: 20th ACM Symposium on Principles of Database Systems (PODS), May 2001, ACM-SIAM (2001)","key":"106_CR25"},{"issue":"6","key":"106_CR26","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1006\/eujc.2002.0591","volume":"23","author":"J.H. Koolen","year":"2002","unstructured":"Koolen, J.H., Moulton, V.: Hyperbolic bridged graphs. European Journal of Combinatorics\u00a023(6), 683\u2013699 (2002)","journal-title":"European Journal of Combinatorics"},{"issue":"1","key":"106_CR27","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1090\/S0273-0979-1995-00569-0","volume":"32","author":"F. Lazebnik","year":"1995","unstructured":"Lazebnik, F., Ustimenko, V.A., Woldar, A.J.: A new series of dense graphs of high girth. Bulletin of the American Mathematical Society (New Series)\u00a032(1), 73\u201379 (1995)","journal-title":"Bulletin of the American Mathematical Society (New Series)"},{"doi-asserted-by":"crossref","unstructured":"Mendel, M., Har-Peled, S.: Fast construction of nets in low dimensional metrics, and their applications. In: 21st Annual ACM Symposium on Computational Geometry (SoCG), pp. 150\u2013158 (2005)","key":"106_CR28","DOI":"10.1145\/1064092.1064117"},{"key":"106_CR29","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0166-218X(98)00128-0","volume":"91","author":"V. Moulton","year":"1999","unstructured":"Moulton, V., Steel, M.A.: Retractions of finite distance functions onto tree metrics. Discrete Applied Mathematics\u00a091, 215\u2013233 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"106_CR30","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5","volume":"33","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Proximity-preserving labeling schemes. Journal of Graph Theory\u00a033, 167\u2013176 (2000)","journal-title":"Journal of Graph Theory"},{"key":"106_CR31","first-page":"41","volume-title":"24th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"A. Slivkins","year":"2005","unstructured":"Slivkins, A.: Distance estimation and object location via rings of neighbors. In: 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 41\u201350. ACM Press, New York (2005)"},{"doi-asserted-by":"crossref","unstructured":"Talwar, K.: Bypassing the embedding: Algorithms for low dimensional metrics. In: 36th Annual ACM Symposium on Theory of Computing (STOC), June 2004, pp. 281\u2013290 (2004)","key":"106_CR32","DOI":"10.1145\/1007352.1007399"},{"issue":"6","key":"106_CR33","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1145\/1039488.1039493","volume":"51","author":"M. Thorup","year":"2004","unstructured":"Thorup, M.: Compact oracles for reachability and approximate distances in planar digraphs. Journal of the ACM\u00a051(6), 993\u20131024 (2004)","journal-title":"Journal of the ACM"},{"issue":"1","key":"106_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1044731.1044732","volume":"52","author":"M. Thorup","year":"2005","unstructured":"Thorup, M., Zwick, U.: Approximate distance oracles. Journal of the ACM\u00a052(1), 1\u201324 (2005)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11602613_106.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:02:30Z","timestamp":1619506950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11602613_106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309352","9783540324263"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11602613_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}