{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T01:41:23Z","timestamp":1701999683321},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T00:00:00Z","timestamp":1207008000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s00446-008-0061-5","type":"journal-article","created":{"date-parts":[[2008,3,31]],"date-time":"2008-03-31T07:30:29Z","timestamp":1206948629000},"page":"141-161","source":"Crossref","is-referenced-by-count":5,"title":["Compact separator decompositions in dynamic trees and applications to labeling schemes"],"prefix":"10.1007","volume":"21","author":[{"given":"Amos","family":"Korman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,4,1]]},"reference":[{"issue":"6","key":"61_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. and Rauhe T. (2006). Compact labeling scheme for ancestor queries. SIAM J. Comput. 35(6): 1295\u20131309","journal-title":"SIAM J. Comput."},{"key":"61_CR2","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact labeling schemes for ancestor queries. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, January (2001)"},{"key":"61_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/227595.227596","volume":"43","author":"Y. Afek","year":"1996","unstructured":"Afek Y., Awerbuch B., Plotkin S.A. and Saks M. (1996). Local management of a global resource in a communication. J. ACM 43: 1\u201319","journal-title":"J. ACM"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"Afek, Y., Gafni, E., Ricklin, M.: Upper and lower bounds for routing schemes in dynamic networks. In: Proc. 30th Symp. on Foundations of Computer Science, pp. 370\u2013375 (1989)","DOI":"10.1109\/SFCS.1989.63505"},{"key":"61_CR5","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/s00224-004-1155-5","volume":"37","author":"S. Alstrup","year":"2004","unstructured":"Alstrup S., Gavoille C., Kaplan H. and Rauhe T. (2004). Nearest common ancestors: a survey and a new distributed algorithm. Theory Comput. Syst. 37: 441\u2013456","journal-title":"Theory Comput. Syst."},{"key":"61_CR6","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: Proc. 43rd IEEE Symp. on Foundations of Computer Science, November (2002)","DOI":"10.1109\/SFCS.2002.1181882"},{"issue":"4","key":"61_CR7","doi-asserted-by":"crossref","first-page":"894","DOI":"10.1137\/S0097539700370539","volume":"34","author":"R. Cole","year":"2005","unstructured":"Cole R. and Hariharan R. (2005). Dynamic LCA queries on trees. SIAM J. Comput. 34(4): 894\u2013923","journal-title":"SIAM J. Comput."},{"key":"61_CR8","volume-title":"Algorithms and Theoretical Computing Handbook, Chap. 8","author":"D. Eppstein","year":"1999","unstructured":"Eppstein D., Galil Z. and Italiano G.F. (1999). Dynamic graph algorithms. In: Atallah, M.J. (eds) Algorithms and Theoretical Computing Handbook, Chap. 8. CRC Press, Boca Raton"},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: Proc. 28th Int. Colloq. on Automata, Languages & Prog., LNCS, vol. 2076, pp. 757\u2013772, July (2001)","DOI":"10.1007\/3-540-48224-5_62"},{"key":"61_CR10","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: A space lower bound for routing in trees. In: Proc. 19th Symp. on Theoretical Aspects of Computer Science, pp. 65\u201375, March (2002)","DOI":"10.1007\/3-540-45841-7_4"},{"key":"61_CR11","unstructured":"Feigenbaum, J., Kannan, S.: Dynamic graph algorithms. In: Handbook of Discrete and Combinatorial Mathematics. CRC Press, Boca Raton (2000)"},{"key":"61_CR12","doi-asserted-by":"crossref","unstructured":"Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: 9th European Symp. on Algorithms, pp. 476\u2013488, August (2001)","DOI":"10.1007\/3-540-44676-1_40"},{"key":"61_CR13","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1137\/0405049","volume":"5","author":"S. Kannan","year":"1992","unstructured":"Kannan S., Naor M. and Rudich S. (1992). Implicit Representation of Graphs. SIAM J. Discrete Math. 5: 596\u2013603","journal-title":"SIAM J. Discrete Math."},{"key":"61_CR14","doi-asserted-by":"crossref","unstructured":"Korman, A.: General Compact Labeling schemes for dynamic trees. In Proc. 19th Symp. on Distributed Computing, September (2005)","DOI":"10.1007\/11561927_33"},{"key":"61_CR15","doi-asserted-by":"crossref","unstructured":"Korman, A.: Labeling Schemes for vertex connectivity. In: Proc. 34th Int. Colloq. on Automata, Languages and Prog., July (2007)","DOI":"10.1007\/978-3-540-73420-8_11"},{"key":"61_CR16","doi-asserted-by":"crossref","unstructured":"Korman, A. Kutten, S.: Controller and estimator for dynamic networks. In: Proc. 26th ACM Symp. on Principles of Distributed Computing, August (2007)","DOI":"10.1145\/1281100.1281127"},{"key":"61_CR17","doi-asserted-by":"crossref","unstructured":"Korman, A., Peleg, D.: Labeling schemes for weighted dynamic trees. In: Proc. 30th Int. Colloq. on Automata, Languages & Prog., July (2003)","DOI":"10.1007\/3-540-45061-0_31"},{"key":"61_CR18","doi-asserted-by":"crossref","unstructured":"Korman, A., Peleg, D.: Dynamic routing schemes for general graphs. In: Proc. 33rd Int. Colloq. on Automata, Languages & Prog. (2006)","DOI":"10.1007\/11786986_54"},{"key":"61_CR19","doi-asserted-by":"crossref","unstructured":"Korman, A., Peleg, D., Rodeh, Y.: Labeling schemes for dynamic tree networks. Theory of Computing Systems 37(1), Special Issue of STACS\u201902 papers, pp. 49\u201375 (2004)","DOI":"10.1007\/s00224-003-1106-6"},{"key":"61_CR20","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: a :ocality-sensitive Approach","author":"D. Peleg","year":"2000","unstructured":"Peleg D. (2000). Distributed Computing: a :ocality-sensitive Approach. SIAM, Philadelphia"},{"key":"61_CR21","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Informative labeling schemes for graphs. Theoretical Computer Science 340, Special Issue of MFCS\u201900 papers, pp. 577\u2013593 (2005)","DOI":"10.1016\/j.tcs.2005.03.015"},{"key":"61_CR22","volume-title":"Computer Networks: A Systems Approach","author":"L.L. Peterson","year":"2007","unstructured":"Peterson L.L. and Davie B.S. (2007). Computer Networks: A Systems Approach. Morgan Kaufmann, San Francisco"},{"issue":"6","key":"61_CR23","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber B. and Vishkin U. (1988). On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6): 1253\u20131262","journal-title":"SIAM J. Comput."},{"issue":"1","key":"61_CR24","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator D.D. and Tarjan R.E. (1983). A data structure for dynamic trees. J. Comput. Syst. Sci. 26(1): 362\u2013391","journal-title":"J. Comput. Syst. Sci."},{"key":"61_CR25","volume-title":"Computer Networks","author":"A.S. Tanenbaum","year":"2003","unstructured":"Tanenbaum A.S. (2003). Computer Networks. Prentice Hall, Englewood Cliffs"},{"key":"61_CR26","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. 13th ACM Symp. on Parallel Algorithms and Architecture, pp. 1\u201310, July (2001)","DOI":"10.1145\/378580.378581"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0061-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-008-0061-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-008-0061-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:37Z","timestamp":1559136397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-008-0061-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4,1]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["61"],"URL":"https:\/\/doi.org\/10.1007\/s00446-008-0061-5","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,4,1]]}}}