{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:40:07Z","timestamp":1648676407836},"reference-count":11,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Algorithms and Applications"],"published-print":{"date-parts":[[1993,1]]},"DOI":"10.1080\/10637199308915435","type":"journal-article","created":{"date-parts":[[2007,7,7]],"date-time":"2007-07-07T06:50:57Z","timestamp":1183791057000},"page":"115-126","source":"Crossref","is-referenced-by-count":0,"title":["AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER\u2217"],"prefix":"10.1080","volume":"1","author":[{"given":"JUNG-JU","family":"CHOI","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"CHANG-SUNG","family":"JEONG","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MYUNG-SOO","family":"KIM","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1968.229158"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675280"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1145\/359461.359481"},{"key":"CIT0004","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","volume":"20","author":"Nassimi D.","year":"1981","journal-title":"IEEE Trans, on Comput."},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840383"},{"key":"CIT0006","doi-asserted-by":"crossref","unstructured":"M. J. Atallah and S. E. Hambrusch , Solving tree problems on a mesh-connected processor array , Proc. 26th IEEE FOCS Conference ( 1985 ), 222 \u2013 231 .","DOI":"10.1109\/SFCS.1985.53"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1145\/360881.360919"},{"key":"CIT0008","unstructured":"G. T. Toussaint , Pattern recognition and geometrical complexity , Proc. 5th Int. Conf. Pattern Recognition ( 1980 ), 1324 \u2013 1347 ."},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90005-7"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90007-6"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1007\/BF01762120"}],"container-title":["Parallel Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10637199308915435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T07:01:27Z","timestamp":1556607687000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10637199308915435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["10.1080\/10637199308915435"],"URL":"https:\/\/doi.org\/10.1080\/10637199308915435","relation":{},"ISSN":["1063-7192"],"issn-type":[{"value":"1063-7192","type":"print"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}