{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:20:54Z","timestamp":1743060054923,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_47","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"565-576","source":"Crossref","is-referenced-by-count":6,"title":["Path Minima in Incremental Unrooted Trees"],"prefix":"10.1007","author":[{"given":"Haim","family":"Kaplan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nira","family":"Shafrir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"Alon, N., Schieber, B.: Optimal preprocessing for answering on-line product queries. Technical report Tech. Report 71\/87, Tel Aviv University"},{"key":"47_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45022-X_8","volume-title":"Automata, Languages and Programming","author":"S. Alstrup","year":"2000","unstructured":"Alstrup, S., Holm, J.: Improved algorithms for finding level ancestors in dynamic trees. In: Welzl, E., Montanari, U., Rolim, J. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 73\u201384. Springer, Heidelberg (2000)"},{"issue":"1","key":"47_CR3","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1142\/S0218195991000049","volume":"1","author":"B. Chazelle","year":"1991","unstructured":"Chazelle, B., Rosenberg, B.: The complexity of computing partial sums off-line. Int. J. Comput. Geometry Appl.\u00a01(1), 33\u201345 (1991)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"3","key":"47_CR4","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","volume":"48","author":"M.L. Fredman","year":"1994","unstructured":"Fredman, M.L., Willard, D.E.: Trans-dichotomous algorithms for minimum spanning trees and shortest paths. J. Comput. Syst. Sci.\u00a048(3), 533\u2013551 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"47_CR5","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: A scaling algorithm for weighted matching on general graphs. In: FOCS, pp. 90\u2013100 (1985)","DOI":"10.1109\/SFCS.1985.3"},{"key":"47_CR6","unstructured":"Gabow, H.N.: Data structures for weighted matching and nearest common ancestors with linking. In: SODA, pp. 434\u2013443 (1990)"},{"key":"47_CR7","unstructured":"Georgiadis, L., Kaplan, H., Shafrir, N., Tarjan, R.E., Werneck, R.F.: Data structures for mergeable trees (2007), \n                      http:\/\/arxiv.org\/abs\/0711.1682v1"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"Georgiadis, L., Tarjan, R.E., Werneck, R.F.: Design of data structures for mergeable trees. In: SODA, pp. 394\u2013403 (2006)","DOI":"10.1145\/1109557.1109602"},{"key":"47_CR9","unstructured":"Kaplan, H., Shafrir, N.: Finding path minima in incremental unrooted trees. Technical report, \n                      http:\/\/www.cs.tau.ac.il\/~haimk\/papers\/pathmin.pdf"},{"key":"47_CR10","unstructured":"La Poutre, J.A.: New techniques for the union-find problem. In: SODA, pp. 54\u201363 (1990)"},{"issue":"4","key":"47_CR11","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/322154.322161","volume":"26","author":"R.E. Tarjan","year":"1979","unstructured":"Tarjan, R.E.: Applications of path compression on balanced trees. J. ACM\u00a026(4), 690\u2013715 (1979)","journal-title":"J. ACM"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Space-time tradeoff for answering range queries (extended abstract). In: STOC, pp. 128\u2013136 (1982)","DOI":"10.1145\/800070.802185"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:18:30Z","timestamp":1715059110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}