{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:47:48Z","timestamp":1725497268749},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540771180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77120-3_63","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:31:09Z","timestamp":1196940669000},"page":"728-738","source":"Crossref","is-referenced-by-count":2,"title":["Distributed Relationship Schemes for Trees"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Gavoille","sequence":"first","affiliation":[]},{"given":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1137\/S0097539703437211","volume":"35","author":"S. Abiteboul","year":"2006","unstructured":"Abiteboul, S., Alstrup, S., Kaplan, H., Milo, T., Rauhe, T.: Compact labeling schemes for ancestor queries. SIAM Journal on Computing\u00a035, 1295\u20131309 (2006)","journal-title":"SIAM Journal on Computing"},{"key":"63_CR2","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: 12 th Symposium on Discrete Algorithms (SODA), pp. 547\u2013556 (January 2001)"},{"key":"63_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1281100.1281110","volume-title":"26 th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"I. Abraham","year":"2007","unstructured":"Abraham, I., Balakrishnan, M., Kuhn, F., Malkhi, D., Talwar, K., Ramasubramanian, V.: Reconstructing approximate tree metrics. In: 26 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 43\u201352. ACM Press, New York (2007)"},{"key":"63_CR4","unstructured":"Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. In: 14 th Symposium on Discrete Algorithms (SODA), ACM-SIAM, pp. 689\u2013698 (2003)"},{"key":"63_CR5","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1137\/S0895480103433409","volume":"19","author":"S. Alstrup","year":"2005","unstructured":"Alstrup, S., Bille, P., Rauhe, T.: Labeling schemes for small distances in trees. SIAM Journal on Discrete Mathematics\u00a019, 448\u2013462 (2005)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"63_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/SFCS.2002.1181882","volume-title":"43 rd Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"S. Alstrup","year":"2002","unstructured":"Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: 43 rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 53\u201362. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"63_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1007\/11602613_111","volume-title":"Algorithms and Computation","author":"F. Bazzaro","year":"2005","unstructured":"Bazzaro, F., Gavoille, C.: Localized and compact data-structure for comparability graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 1122\u20131131. Springer, Heidelberg (2005)"},{"issue":"2","key":"63_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jalgor.2004.07.011","volume":"61","author":"V.D. Chepoi","year":"2006","unstructured":"Chepoi, V.D., Dragan, F.F., Vaxes, Y.: Distance and routing labeling schemes for non-positively curved plane graphs. Journal of Algorithms\u00a061(2), 60\u201388 (2006)","journal-title":"Journal of Algorithms"},{"key":"63_CR9","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1002\/jgt.3190140408","volume":"14","author":"F.R.K. Chung","year":"1990","unstructured":"Chung, F.R.K.: Universal graphs and induced-universal graphs. Journal of Graph Theory\u00a014, 443\u2013454 (1990)","journal-title":"Journal of Graph Theory"},{"key":"63_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/978-3-540-30551-4_36","volume-title":"Algorithms and Computation","author":"F.F. Dragan","year":"2004","unstructured":"Dragan, F.F., Lomonosov, I.: On compact and efficient routing in certain graph classes. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 402\u2013414. Springer, Heidelberg (2004)"},{"key":"63_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/3-540-48224-5_62","volume-title":"Automata, Languages and Programming","author":"P. Fraigniaud","year":"2001","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 757\u2013772. Springer, Heidelberg (2001)"},{"key":"63_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/11602613_106","volume-title":"Algorithms and Computation","author":"C. Gavoille","year":"2005","unstructured":"Gavoille, C., Ly, O.: Distance labeling in hyperbolic graphs. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 1071\u20131079. Springer, Heidelberg (2005)"},{"key":"63_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"63_CR14","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. Distributed Computing\u00a016, 111\u2013120 (2003) PODC 20-Year Special Issue","journal-title":"Distributed Computing"},{"key":"63_CR15","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, 85\u2013112 (2004)","journal-title":"Journal of Algorithms"},{"key":"63_CR16","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0605032","volume":"5","author":"J.R. Gilbert","year":"1984","unstructured":"Gilbert, J.R., Rose, D.J., Edenbrandt, A.: A separator theorem for chordal graphs. SIAM Journal on Algebraic and Discrete Methods\u00a05, 306\u2013313 (1984)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"63_CR17","first-page":"334","volume-title":"20 th Annual ACM Symposium on Theory of Computing (STOC)","author":"S. Kannan","year":"1988","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. In: 20 th Annual ACM Symposium on Theory of Computing (STOC), pp. 334\u2013343. ACM Press, New York (1988)"},{"key":"63_CR18","first-page":"9","volume-title":"24 th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"A. Korman","year":"2005","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling system. In: 24 th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 9\u201318. ACM Press, New York (2005)"},{"key":"63_CR19","series-title":"Lecture Notes in Computer Science","volume-title":"21 st International Symposium on Distributed Computing (DISC)","author":"A. Korman","year":"2007","unstructured":"Korman, A., Peleg, D.: Compact separator decompositions in dynamic trees and applications to labeling schemes. In: 21 st International Symposium on Distributed Computing (DISC). LNCS, vol.\u00a04731, Springer, Heidelberg (2007)"},{"key":"63_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11940128_42","volume-title":"Algorithms and Computation","author":"A. Korman","year":"2006","unstructured":"Korman, A., Peleg, D., Rodeh, Y.: Constructing labeling schemes through universal matrices. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol.\u00a04288, pp. 409\u2013418. Springer, Heidelberg (2006)"},{"key":"63_CR21","first-page":"1","volume-title":"13 th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA)","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: 13 th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1\u201310. ACM Press, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77120-3_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,30]],"date-time":"2021-08-30T00:14:54Z","timestamp":1630282494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77120-3_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771180"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77120-3_63","relation":{},"subject":[]}}