{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:09:15Z","timestamp":1725491355039},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75142-7_25","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T14:00:46Z","timestamp":1189000846000},"page":"313-327","source":"Crossref","is-referenced-by-count":1,"title":["Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes"],"prefix":"10.1007","author":[{"given":"Amos","family":"Korman","sequence":"first","affiliation":[]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"25_CR1","doi-asserted-by":"publisher","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 Scheme for Ancestor Queries. SIAM J. Computing\u00a035(6), 1295\u20131309 (2006)","journal-title":"SIAM J. Computing"},{"key":"25_CR2","volume-title":"Proc. 12th ACM-SIAM Symp. on Discrete Algorithms","author":"S. Abiteboul","year":"2001","unstructured":"Abiteboul, S., Kaplan, H., Milo, T.: Compact Labeling Schemes for Ancestor Queries. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, ACM Press, New York (2001)"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/227595.227596","volume":"43","author":"Y. Afek","year":"1996","unstructured":"Afek, Y., Awerbuch, B., Plotkin, S.A., Saks, M.: Local Management of a Global Resource in a Communication. J. ACM\u00a043, 1\u201319 (1996)","journal-title":"J. ACM"},{"key":"25_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":"25_CR5","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 Distributed Algorithm. Theory of Computing Systems\u00a037, 441\u2013456 (2004)","journal-title":"Theory of Computing Systems"},{"key":"25_CR6","volume-title":"Proc. 43rd IEEE Symp. on Foundations of Computer Science","author":"S. Alstrup","year":"2002","unstructured":"Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: Proc. 43rd IEEE Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos (2002)"},{"issue":"4","key":"25_CR7","doi-asserted-by":"publisher","first-page":"894","DOI":"10.1137\/S0097539700370539","volume":"34","author":"R. Cole","year":"2005","unstructured":"Cole, R., Hariharan, R.: Dynamic LCA Queries on Trees. SIAM J. Computing\u00a034(4), 894\u2013923 (2005)","journal-title":"SIAM J. Computing"},{"key":"25_CR8","volume-title":"Algorithms and Theoretical Computing Handbook, ch. 8","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F.: Dynamic Graph Algorithms. In: Atallah, M.J. (ed.) Algorithms and Theoretical Computing Handbook, ch. 8, CRC Press, Boca Raton, USA (1999)"},{"key":"25_CR9","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":"25_CR10","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: A space lower bound for routing in trees. In: Proc. 19th Int. Symp. on Theoretical Aspects of Computer Science, pp. 65\u201375 (March 2002)","DOI":"10.1007\/3-540-45841-7_4"},{"key":"25_CR11","volume-title":"Handbook of Discrete and Combinatorial Mathematics","author":"J. Feigenbaum","year":"2000","unstructured":"Feigenbaum, J., Kannan, S.: Dynamic Graph Algorithms. In: Handbook of Discrete and Combinatorial Mathematics, CRC Press, Boca Raton, USA (2000)"},{"key":"25_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":"25_CR13","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 J. on Descrete Math.\u00a05, 596\u2013603 (1992)","journal-title":"SIAM J. on Descrete Math."},{"key":"25_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":"25_CR15","doi-asserted-by":"crossref","unstructured":"Korman, A.: Labeling Schemes for Vertex Connectivity. In: ICALP. Proc. 34th Int. Colloq. on Automata, Languages and Prog. (July 2007)","DOI":"10.1007\/978-3-540-73420-8_11"},{"key":"25_CR16","volume-title":"Proc. 26th ACM Symp. on Principles of Distributed Computing","author":"A. Korman","year":"2007","unstructured":"Korman, A., Kutten, S.: Controller and Estimator for Dynamic Networks. In: Proc. 26th ACM Symp. on Principles of Distributed Computing, ACM Press, New York (2007)"},{"key":"25_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"},{"issue":"1","key":"25_CR18","first-page":"49","volume":"37","author":"A. Korman","year":"2004","unstructured":"Korman, A., Peleg, D., Rodeh, Y.: Labeling Schemes for Dynamic Tree Networks. Theory of Computing Systems, Special Issue of STACS 2002 papers\u00a037(1), 49\u201375 (2004)","journal-title":"Theory of Computing Systems, Special Issue of STACS 2002 papers"},{"key":"25_CR19","first-page":"577","volume":"340","author":"D. Peleg","year":"2005","unstructured":"Peleg, D.: Informative Labeling Schemes for Graphs. Theoretical Computer Science, Special Issue of MFCS 2000 papers\u00a0340, 577\u2013593 (2005)","journal-title":"Theoretical Computer Science, Special Issue of MFCS 2000 papers"},{"key":"25_CR20","volume-title":"Computer Networks: A Systems Approach","author":"L.L. Peterson","year":"2007","unstructured":"Peterson, L.L., Davie, B.S.: Computer Networks: A Systems Approach. Morgan Kaufmann, San Francisco (2007)"},{"issue":"6","key":"25_CR21","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding Lowest Common Ancestors: Simplification and Parallelization. SIAM J. Computing\u00a017(6), 1253\u20131262 (1988)","journal-title":"SIAM J. Computing"},{"issue":"1","key":"25_CR22","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","volume":"26","author":"D.D. Sleator","year":"1983","unstructured":"Sleator, D.D., Tarjan, R.E.: A Data Structure for Dynamic Trees. J. Computer & System Sciences\u00a026(1), 362\u2013391 (1983)","journal-title":"J. Computer & System Sciences"},{"key":"25_CR23","volume-title":"Computer Networks","author":"A.S. Tanenbaum","year":"2003","unstructured":"Tanenbaum, A.S.: Computer Networks. Prentice-Hall, Englewood Cliffs (2003)"},{"key":"25_CR24","first-page":"1","volume-title":"Proc. 13th ACM Symp. on Parallel Algorithms and Architecture","author":"M. Thorup","year":"2001","unstructured":"Thorup, M., Zwick, U.: Compact Routing Schemes. In: Proc. 13th ACM Symp. on Parallel Algorithms and Architecture, pp. 1\u201310. ACM Press, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T01:57:48Z","timestamp":1558490268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540751410","9783540751427"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}