{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:37Z","timestamp":1725455917740},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023449","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:06:33Z","timestamp":1132383993000},"page":"67-79","source":"Crossref","is-referenced-by-count":3,"title":["Memory management for Union-Find algorithms"],"prefix":"10.1007","author":[{"given":"Christophe","family":"Fiorio","sequence":"first","affiliation":[]},{"given":"Jens","family":"Gustedt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0020-0190(80)90001-0","volume":"11","author":"L. Banachowski","year":"1980","unstructured":"L. Banachowski, A complement to Tarjan 's result about the lower bound on the complexity of the set union problem, Inform. Process. Lett., 11 (1980), pp. 59\u201365.","journal-title":"Inform. Process. Lett."},{"key":"6_CR2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/128749.128750","volume":"39","author":"M. B. Dillencourt","year":"1992","unstructured":"M. B. Dillencourt, H. Samet, and M. Tamminen, A general approach to connected-component labeling for arbitrary image representations, J. Assoc. Comput. Mach., 39 (1992), pp. 253\u2013280. Corr p. 985\u2013986.","journal-title":"J. Assoc. Comput. Mach."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0304-3975(94)00262-2","volume":"154","author":"C. Fiorio","year":"1996","unstructured":"C. Fiorio and J. Gustedt, Two linear time Union-Find strategies for image processing, Theoret. Comput. Sci., 154 (1996), pp. 165\u2013181.","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR4","volume-title":"Tech. Rep. 515\/1996","author":"C. Fiorio","year":"1996","unstructured":"-, Volume segmentation of 3-dimensional images, Tech. Rep. 515\/1996, Technische Universit\u00e4t Berlin, 1996."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"J. Gustedt, Efficient union-find for planar graphs and other sparse graph classes, in Graph-Theoretic Concepts in Computer Science, 22nd International Workshop WG '96, Ausiello et al., eds., Lecture Notes in Computer Science, Springer-Verlag, 1996, pp. 181\u2013195. to appear.","DOI":"10.1007\/3-540-62559-3_16"},{"key":"6_CR6","unstructured":"J. A. La Poutr\u00e9, New techniques for the union-find problem, in Proceedings of the first annual ACM-SIAM Symposium on Discrete Algorithms, A. Aggarwal et al., eds., Society of Industrial and Applied Mathematics (SIAM), 1990, pp. 54\u201363."},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, Springer, 1984.","DOI":"10.1007\/978-3-642-69672-5"},{"key":"6_CR8","series-title":"Data Structures","first-page":"301","volume-title":"Handbook of Theoretical Computer Science, vol. A, Algorithms and Complexity","author":"K. Mehlhorn","year":"1990","unstructured":"K. Mehlhorn and A. Tsakalidis, Handbook of Theoretical Computer Science, vol. A, Algorithms and Complexity, Elsevier Science Publishers B.V., Amsterdam, 1990, ch. 6, Data Structures, pp. 301\u2013314."},{"key":"6_CR9","unstructured":"J. Muerle and D. Allen, Experimental evaluation of techniques for automatic segmentation of objects in a complex scene, in Pictorial Pattern Recognition, G. C. Cheng et al., eds., Thompson, Washington, 1968, pp. 3\u201313."},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(83)90079-5","volume":"35","author":"N. Robertson","year":"1983","unstructured":"N. Robertson and P. Seymour, Graph minors I, excluding a forest, J. Combin. Theory Ser. B, 35 (1983), pp. 39\u201361.","journal-title":"J. Combin. Theory Ser. B"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. E. Tarjan","year":"1975","unstructured":"R. E. Tarjan, Efficiency of a good but not linear set union algorithm, J. Assoc. Comput. Mach., 22 (1975), pp. 215\u2013225.","journal-title":"J. Assoc. Comput. Mach."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","volume":"18","author":"R. E. Tarjan","year":"1979","unstructured":"-, A class of algorithms which require non-linear time to maintain disjoint sets, J. Comput. System Sci., 18 (1979), pp. 110\u2013127.","journal-title":"J. Comput. System Sci."},{"key":"6_CR13","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","volume":"31","author":"R. E. Tarjan","year":"1984","unstructured":"R. E. Tarjan and J. van Leeuwen, Worst-case analysis of set union algorithms, J. Assoc. Comput. Mach., 31 (1984), pp. 245\u2013281.","journal-title":"J. Assoc. Comput. Mach."},{"key":"6_CR14","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1145\/174130.174140","volume":"40","author":"M. J. Kreveld van","year":"1993","unstructured":"M. J. van Kreveld and M. H. Overmars, Union-copy structures and dynamic segment trees, J. of the Association for Computing Machinery, 40 (1993), pp. 635\u2013652.","journal-title":"J. of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:31:59Z","timestamp":1586568719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/bfb0023449","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}