{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T08:46:13Z","timestamp":1725612373535},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540359043"},{"type":"electronic","value":"9783540359050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11786986_54","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T10:46:45Z","timestamp":1151491605000},"page":"619-630","source":"Crossref","is-referenced-by-count":10,"title":["Dynamic Routing Schemes for General Graphs"],"prefix":"10.1007","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","reference":[{"key":"54_CR1","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 network. J. ACM\u00a043, 1\u201319 (1996)","journal-title":"J. ACM"},{"key":"54_CR2","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":"54_CR3","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0196-6774(90)90017-9","volume":"11","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved routing strategies with succinct tables. J. Algorithms\u00a011, 307\u2013341 (1990)","journal-title":"J. Algorithms"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1137\/0405013","volume":"5","author":"B. Awerbuch","year":"1992","unstructured":"Awerbuch, B., Peleg, D.: Routing with polynomial communication-space trade-off. SIAM J. Discrete Math.\u00a05, 307\u2013341 (1992)","journal-title":"SIAM J. Discrete Math."},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1006\/jagm.2000.1134","volume":"38","author":"L. Cowen","year":"2001","unstructured":"Cowen, L.: Compact routing with minimum stretch. J. Algorithms\u00a038, 170\u2013183 (2001)","journal-title":"J. Algorithms"},{"key":"54_CR6","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/S0097539797316610","volume":"29","author":"S. Dolev","year":"1999","unstructured":"Dolev, S., Kranakis, E., Krizanc, D., Peleg, D.: Bubbles: Adaptive routing scheme for high-speed dynamic networks. SIAM J. on Comput.\u00a029, 804\u2013833 (1999)","journal-title":"SIAM J. on Comput."},{"key":"54_CR7","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 (1999)"},{"key":"54_CR8","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s004460050025","volume":"10","author":"P. Fraigniaud","year":"1997","unstructured":"Fraigniaud, P., Gavoille, C.: Universal routing schemes. Distributed Computing\u00a010, 65\u201378 (1997)","journal-title":"Distributed Computing"},{"key":"54_CR9","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 (2000)"},{"key":"54_CR10","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/568438.568451","volume":"32","author":"C. Gavoille","year":"2001","unstructured":"Gavoille, C.: Routing in distributed networks: Overview and open problems. ACM SIGACT News-Distributed Computing Column\u00a032, 36\u201352 (2001)","journal-title":"ACM SIGACT News-Distributed Computing Column"},{"key":"54_CR11","doi-asserted-by":"crossref","unstructured":"Iwama, K., Kawachi, A.: Compact routing with stretch factor less than three. In: Proc. 19th ACM Symp. on Principles of Distributed Computing, p. 337 (2000)","DOI":"10.1145\/343477.362158"},{"key":"54_CR12","doi-asserted-by":"crossref","unstructured":"Iwama, K., Okita, M.: Compact Routing for Flat Networks. In: Proc. 17th International Simposium on Distributed Computing (October 2003)","DOI":"10.1007\/978-3-540-39989-6_14"},{"key":"54_CR13","doi-asserted-by":"crossref","unstructured":"Korman, A.: General Compact Labeling Schemes for Dynamic Trees. In: Proc. 19th International Simposium on Distributed Computing (September 2005)","DOI":"10.1007\/11561927_33"},{"key":"54_CR14","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00224-003-1106-6","volume":"37","author":"A. Korman","year":"2004","unstructured":"Korman, A., Peleg, D., Rodeh, Y.: Labeling schemes for dynamic tree networks. Theory of Computing Systems\u00a037, 49\u201375 (2004)","journal-title":"Theory of Computing Systems"},{"key":"54_CR15","doi-asserted-by":"crossref","unstructured":"Korman, A., Peleg, D.: Labeling schemes for weighted dynamic trees. In: Proc. 30th Int. Colloq. on Automata, Languages and Prog, July 2003, pp. 369\u2013383 (2003)","DOI":"10.1007\/3-540-45061-0_31"},{"key":"54_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed computing: A Locality-Sensitive Approach","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Distributed computing: A Locality-Sensitive Approach. SIAM, Philadelphia (2000)"},{"key":"54_CR17","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1145\/65950.65953","volume":"36","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., Upfal, E.: A tradeoff between size and efficiency for routing tables. J. ACM\u00a036, 510\u2013530 (1989)","journal-title":"J. ACM"},{"key":"54_CR18","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"28","author":"N. Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labeling and implicit routing in networks. The Computer Journal\u00a028, 5\u20138 (1985)","journal-title":"The Computer Journal"},{"key":"54_CR19","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: Proc. 13th ACM Symp. on Parallel Algorithms and Architectures, July 2001, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11786986_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:54Z","timestamp":1619507994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11786986_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540359043","9783540359050"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11786986_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}