{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T09:28:00Z","timestamp":1780392480538,"version":"3.54.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,2,1]],"date-time":"1996-02-01T00:00:00Z","timestamp":823132800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6376,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,2]]},"DOI":"10.1016\/0304-3975(94)00262-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:42:52Z","timestamp":1027611772000},"page":"165-181","source":"Crossref","is-referenced-by-count":171,"title":["Two linear time Union-Find strategies for image processing"],"prefix":"10.1016","volume":"154","author":[{"given":"Christophe","family":"Fiorio","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jens","family":"Gustedt","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00262-2_BIB1","series-title":"Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms","year":"1990"},{"key":"10.1016\/0304-3975(94)00262-2_BIB2","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0020-0190(80)90001-0","article-title":"A complement to Tarjan's result about the lower bound on the complexity of the set union problem","volume":"11","author":"Banachowski","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(94)00262-2_BIB3_1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/128749.128750","article-title":"A general approach to connected-component labeling for arbitrary image representations","volume":"39","author":"Dillencourt","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00262-2_BIB3_2","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1145\/146585.1189955","article-title":"Corr.","volume":"39","author":"Dillencourt","year":"1992","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00262-2_BIB4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","article-title":"A linear-time algorithm for a special case of disjoint set union","volume":"30","author":"Gabow","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00262-2_BIB5","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0734-189X(85)90153-7","article-title":"Survey: image segmentation techniques","volume":"29","author":"Haralick","year":"1985","journal-title":"Comput. Vision Graphics Image Process"},{"key":"10.1016\/0304-3975(94)00262-2_BIB6","article-title":"Lower bounds for the union-find and the split-find problem on pointer machines","author":"La Poutr\u00e9","year":"1989","journal-title":"RUU-CS-89-21"},{"key":"10.1016\/0304-3975(94)00262-2_BIB7","article-title":"New techniques for the union-find problem","author":"La Poutr\u00e9","year":"1989","journal-title":"RUU-CS-89-19"},{"key":"10.1016\/0304-3975(94)00262-2_BIB8","series-title":"Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms","first-page":"54","article-title":"New techniques for the union-find problem","author":"La Poutr\u00e9","year":"1990"},{"key":"10.1016\/0304-3975(94)00262-2_BIB9","article-title":"Dynamic graph algorithms and data structures","author":"La Poutr\u00e9","year":"1991"},{"key":"10.1016\/0304-3975(94)00262-2_BIB10","series-title":"Data Structures and Algorithms 1: Sorting and Searching","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0304-3975(94)00262-2_BIB11","first-page":"301","article-title":"Data structures","author":"Mehlhorn","year":"1990"},{"key":"10.1016\/0304-3975(94)00262-2_BIB12","first-page":"169","article-title":"Segmentation d'images: vers une m\u00e9thodologie","volume":"4","author":"Monga","year":"1987","journal-title":"Traitement du Signal"},{"key":"10.1016\/0304-3975(94)00262-2_BIB13","series-title":"Pictorial Pattern Recognition","first-page":"3","article-title":"Experimental evaluation of techniques for automatic segmentation of objects in a complex scene","author":"Muerle","year":"1968"},{"key":"10.1016\/0304-3975(94)00262-2_BIB14","series-title":"EUROGRAPHICS'91","first-page":"399","article-title":"Several approaches to implement the merging step of the split and merge region segmentation","author":"Popovic","year":"1991"},{"key":"10.1016\/0304-3975(94)00262-2_BIB15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","article-title":"Efficiency of a good but not linear set union algorithm","volume":"22","author":"Tarjan","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00262-2_BIB16","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0022-0000(79)90042-4","article-title":"A class of algorithms which require non-linear time to maintain disjoint sets","volume":"18","author":"Tarjan","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(94)00262-2_BIB17","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/62.2160","article-title":"Worst-case analysis of set union algorithms","volume":"31","author":"Tarjan","year":"1984","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00262-2_BIB18","year":"1990"},{"key":"10.1016\/0304-3975(94)00262-2_BIB19","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/S0146-664X(76)80014-7","article-title":"Survey: region growing: childhood and adolescence","volume":"5","author":"Zucker","year":"1976","journal-title":"Comput. Graphics Image Process"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002622?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002622?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,8]],"date-time":"2021-05-08T03:01:32Z","timestamp":1620442892000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594002622"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,2]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,2]]}},"alternative-id":["0304397594002622"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00262-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,2]]}}}