{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:03:28Z","timestamp":1746331408803,"version":"3.40.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319079585"},{"type":"electronic","value":"9783319079592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07959-2_17","type":"book-chapter","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T16:44:25Z","timestamp":1402418665000},"page":"199-210","source":"Crossref","is-referenced-by-count":2,"title":["An Evaluation of Dynamic Labeling Schemes for Tree Networks"],"prefix":"10.1007","author":[{"given":"Noy","family":"Rotbart","sequence":"first","affiliation":[]},{"given":"Marcos","family":"Vaz Salles","sequence":"additional","affiliation":[]},{"given":"Iasonas","family":"Zotos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"17_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., Saks, M.: Local management of a global resource in a communication network. JACM\u00a043(1), 1\u201319 (1996)","journal-title":"JACM"},{"issue":"2","key":"17_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 J. Discret. Math.\u00a019(2), 448\u2013462 (2005)","journal-title":"SIAM J. Discret. Math."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Halvorsen, E.B., Larsen, K.G.: Near-optimal labeling schemes for nearest common ancestors. arXiv preprint arXiv:1312.4413 (2013)","DOI":"10.1137\/1.9781611973402.72"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Rauhe, T.: Small induced-universal graphs and compact implicit graph representations. In: FOCS 2002, pp. 53\u201362 (2002)","DOI":"10.1109\/SFCS.2002.1181882"},{"key":"17_CR5","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 in coding the vertices of a graph. J. Mathematical Analysis and Applications\u00a020, 583\u2013600 (1967)","journal-title":"J. Mathematical Analysis and Applications"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-87744-8_20","volume-title":"Algorithms - ESA 2008","author":"S. Caminiti","year":"2008","unstructured":"Caminiti, S., Finocchi, I., Petreschi, R.: Engineering tree labeling schemes: A case study on least common ancestors. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 234\u2013245. Springer, Heidelberg (2008)"},{"issue":"5","key":"17_CR7","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E. Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comp.\u00a032(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comp."},{"issue":"5","key":"17_CR8","doi-asserted-by":"publisher","first-page":"2048","DOI":"10.1137\/070687633","volume":"39","author":"E. Cohen","year":"2010","unstructured":"Cohen, E., Kaplan, H., Milo, T.: Labeling dynamic xml trees. SIAM Journal on Computing\u00a039(5), 2048\u20132074 (2010)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1007\/978-3-642-04128-0_67","volume-title":"Algorithms - ESA 2009","author":"J. Fischer","year":"2009","unstructured":"Fischer, J.: Short labels for lowest common ancestors in trees. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 752\u2013763. Springer, Heidelberg (2009)"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Korman, A.: An optimal ancestry scheme and small universal posets. In: STOC 2010, pp. 611\u2013620 (2010)","DOI":"10.1145\/1806689.1806773"},{"key":"17_CR11","volume-title":"The art of computer systems performance analysis","author":"R. Jain","year":"1991","unstructured":"Jain, R.: The art of computer systems performance analysis, vol.\u00a0182. John Wiley & Sons, Chichester (1991)"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Kannan, S., Naor, M., Rudich, S.: Implicit representation of graphs. SIAM Journal on Discrete Mathematics, 334\u2013343 (1992)","DOI":"10.1137\/0405049"},{"key":"17_CR13","unstructured":"Kaplan, H., Milo, T., Shabo, R.: A comparison of labeling schemes for ancestor queries. In: SODA 2002, pp. 954\u2013963 (2002)"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00446-007-0035-z","volume":"20","author":"A. Korman","year":"2007","unstructured":"Korman, A.: General compact labeling schemes for dynamic trees. Distributed Computing\u00a020(3), 179\u2013193 (2007)","journal-title":"Distributed Computing"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Korman, A.: Improved compact routing schemes for dynamic trees. In: PODC 2008, pp. 185\u2013194. ACM (2008)","DOI":"10.1145\/1400751.1400777"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Korman, A.: Compact routing schemes for dynamic trees in the fixed port model. In: Distributed Computing and Networking, pp. 218\u2013229 (2009)","DOI":"10.1007\/978-3-540-92295-7_28"},{"issue":"12","key":"17_CR17","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1016\/j.ic.2007.08.004","volume":"205","author":"A. Korman","year":"2007","unstructured":"Korman, A., Peleg, D.: Labeling schemes for weighted dynamic trees. Information and Computation\u00a0205(12), 1721\u20131740 (2007)","journal-title":"Information and Computation"},{"issue":"1","key":"17_CR18","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(1), 49\u201375 (2004)","journal-title":"Theory of Computing Systems"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/(SICI)1097-0118(200003)33:3<167::AID-JGT7>3.0.CO;2-5","volume":"33","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Proximity-preserving labeling schemes. Journal of Graph Theory\u00a033(3), 167\u2013176 (2000)","journal-title":"Journal of Graph Theory"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: SPAA 2001, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07959-2_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:04:18Z","timestamp":1746263058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07959-2_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319079585","9783319079592"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07959-2_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}