{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T11:56:45Z","timestamp":1648814205787},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":7321,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1993,7]]},"DOI":"10.1016\/0925-7721(93)90002-n","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:40Z","timestamp":1027640740000},"page":"91-105","source":"Crossref","is-referenced-by-count":0,"title":["Determining maximum k-width-connectivity on meshes"],"prefix":"10.1016","volume":"3","author":[{"given":"Susanne E.","family":"Hambrusch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Dehne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(93)90002-N_BIB1","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/S0019-9958(86)80046-8","article-title":"Solving tree problems on a mesh-connected processor array","volume":"69","author":"Atallah","year":"1986","journal-title":"Inform. Control"},{"key":"10.1016\/0925-7721(93)90002-N_BIB2","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1109\/12.45215","article-title":"Algorithms for image component labeling on SIMD mesh connected computers","volume":"39","author":"Cypher","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0925-7721(93)90002-N_BIB3","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/0196-6774(89)90028-X","article-title":"Hypercube and shuffle-exchange algorithms for image component labeling","volume":"10","author":"Cypher","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0925-7721(93)90002-N_BIB4","first-page":"12","article-title":"Parallel algorithms for determining k-width-connectivity in binary images","volume":"12","author":"Dehne","year":"1990","journal-title":"JPDC"},{"key":"10.1016\/0925-7721(93)90002-N_BIB5","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TPAMI.1981.4767048","article-title":"Parallel image processing by memory-augmented cellular automata","volume":"3","author":"Dyer","year":"1981","journal-title":"IEEE Pami"},{"key":"10.1016\/0925-7721(93)90002-N_BIB6","first-page":"477","article-title":"A study of connected component algorithms on the MPP","author":"Hambrusch","year":"1988","journal-title":"Proc. of 3rd Internat. Conf. on Supercomputing"},{"key":"10.1016\/0925-7721(93)90002-N_BIB7","first-page":"169","article-title":"A fast parallel algorithm for labeling connected components in image arrays","author":"Lim","year":"1989"},{"key":"10.1016\/0925-7721(93)90002-N_BIB8","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/361237.361240","article-title":"On shrinking binary picture patterns","volume":"15","author":"Levialdi","year":"1972","journal-title":"CACM"},{"key":"10.1016\/0925-7721(93)90002-N_BIB9","author":"Mead","year":"1980"},{"key":"10.1016\/0925-7721(93)90002-N_BIB10","unstructured":"R. Miller and Q. Stout, Parallel Algorithms for Regular Architectures (MIT Press, Cambridge, MA, to appear)."},{"key":"10.1016\/0925-7721(93)90002-N_BIB11","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0209058","article-title":"Finding connected components and connected ones on a mesh-connected parallel computer","author":"Nassimi","year":"1980","journal-title":"SIAM J. Comp."},{"key":"10.1016\/0925-7721(93)90002-N_BIB12_1","article-title":"Algorithms for graphics and image processing","author":"Pavlidis","year":"1982","journal-title":"CSP"},{"key":"10.1016\/0925-7721(93)90002-N_BIB12_2","unstructured":"J. Reif and Q. Stout, Optimal component labeling algorithms for mesh computers and VLSI, manuscript."},{"key":"10.1016\/0925-7721(93)90002-N_BIB14","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/321556.321570","article-title":"Connectivity in digital pictures","volume":"17","author":"Rosenfeld","year":"1970","journal-title":"JACM"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390002N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:092577219390002N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:51:29Z","timestamp":1555116689000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/092577219390002N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["092577219390002N"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(93)90002-n","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}