{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:26Z","timestamp":1725543806029},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_12","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"143-156","source":"Crossref","is-referenced-by-count":5,"title":["Short Labels by Traversal and Jumping"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Bonichon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Labourel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Abiteboul, S., Alstrup, S., Kaplan, H., Milo, T., Rauhe, T.: Compact labeling schemes for ancestor queries. SIAM Journal on Computing (2005)","DOI":"10.1137\/S0097539703437211"},{"issue":"2","key":"12_CR2","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(2), 448\u2013462 (2005)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s00224-004-1155-5","volume":"37","author":"S. Alstrup","year":"2004","unstructured":"Alstrup, S., Gavoille, C., Kaplan, H., Rauhe, T.: Nearest common ancestors: A survey and a new algorithm for a distributed environment. Theory of Computing Systems\u00a037, 441\u2013456 (2004)","journal-title":"Theory of Computing Systems"},{"key":"12_CR4","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: 12th Symposium on Discrete Algorithms (SODA), pp. 547\u2013556. ACM-SIAM, New York (2001)"},{"key":"12_CR5","first-page":"53","volume-title":"43rd 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: 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 53\u201362. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0022-247X(67)90082-0","volume":"20","author":"M.A. Breuer","year":"1967","unstructured":"Breuer, M.A., Folkman, J.: An unexpected result on coding the vertices of a graph. Journal of Mathematical Analysis and Applications\u00a020, 583\u2013600 (1967)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"12_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)"},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1109\/TIT.1966.1053860","volume":"12","author":"M.A. Breuer","year":"1966","unstructured":"Breuer, M.A.: Coding the vertexes of a graph. IEEE Transactions on Information Theory\u00a0IT-12, 148\u2013153 (1966)","journal-title":"IEEE Transactions on Information Theory IT-"},{"key":"12_CR9","unstructured":"Dragan, F.F., Lomonosov, I.: New routing schemes for interval graphs, circular-arc graphs, and permutation graphs. In: 14th IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), pp. 78\u201383 (November 2002)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 (Extended abstract). In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 402\u2013414. Springer, Heidelberg (2004)"},{"key":"12_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":"12_CR12","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 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":"12_CR13","doi-asserted-by":"crossref","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"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-44634-6_23","volume-title":"Algorithms and Data Structures","author":"H. Kaplan","year":"2001","unstructured":"Kaplan, H., Milo, T.: Short and simple labels for small distances and other functions. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol.\u00a02125, pp. 32\u201340. Springer, Heidelberg (2001)"},{"key":"12_CR15","first-page":"334","volume-title":"20th 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: 20th Annual ACM Symposium on Theory of Computing (STOC), pp. 334\u2013343. ACM Press, New York (1988)"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S. Kannan","year":"1992","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM Journal on Discrete Mathematics\u00a05, 596\u2013603 (1992)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Norine, S., Robertson, N., Thomas, R., Wollan, P.: Proper minor-closed families are small. Journal of Combinatorial Theory, Series B (to appear, 2005)","DOI":"10.1016\/j.jctb.2006.01.006"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), July 2001, pp. 1\u201310. ACM Press, New York (2001)","DOI":"10.1145\/378580.378581"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:07Z","timestamp":1619507827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11780823_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}