{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:21:55Z","timestamp":1649211715010},"reference-count":18,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1993,5,1]],"date-time":"1993-05-01T00:00:00Z","timestamp":736214400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[1993,5]]},"DOI":"10.1016\/0010-4485(93)90084-2","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:47:17Z","timestamp":1047653237000},"page":"269-280","source":"Crossref","is-referenced-by-count":1,"title":["Efficient multiple-way network-partitioning algorithm"],"prefix":"10.1016","volume":"25","author":[{"given":"J.-U.","family":"Kim","sequence":"first","affiliation":[]},{"given":"C.-H.","family":"Lee","sequence":"additional","affiliation":[]},{"given":"M.","family":"Kim","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0010-4485(93)90084-2_BIB1","series-title":"Proc. 14th Design Automation Conf.","first-page":"284","article-title":"A class of min-cut placement algorithms","author":"Breuer","year":"1977"},{"key":"10.1016\/0010-4485(93)90084-2_BIB2","series-title":"Proc. 16th Design Automation Conf.","first-page":"406","article-title":"A placement capability based on partitioning","author":"Corrigan","year":"1979"},{"key":"10.1016\/0010-4485(93)90084-2_BIB3","first-page":"199","article-title":"Heuristic methods for process assignment in distributed computing systems","volume":"Vol 11","author":"Arora","year":"1980"},{"key":"10.1016\/0010-4485(93)90084-2_BIB4","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MC.1982.1654050","article-title":"Heuristic models of task assignment scheduling in distributed systems","author":"Efe","year":"1982","journal-title":"IEEE Comput."},{"key":"10.1016\/0010-4485(93)90084-2_BIB5","series-title":"Proc. 1st Int. Conf. Systems Integration","first-page":"748","article-title":"An efficient k-way graph partitioning algorithm for task allocation in parallel computing systems","author":"Lee","year":"1990"},{"key":"10.1016\/0010-4485(93)90084-2_BIB6","unstructured":"Lee, C H, Lee, D and Kim, M \u2018Optimal task assignment in linear array networks\u2019 IEEE Trans. Comput. (to appear)"},{"key":"10.1016\/0010-4485(93)90084-2_BIB7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"Vol 49","author":"Kernighan","year":"1970","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0010-4485(93)90084-2_BIB8","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0010-4485(93)90084-2_BIB9","series-title":"Proc. 9th Design Automation Wkshp.","first-page":"57","article-title":"A proper model for the partitioning of electrical circuits","author":"Schweikert","year":"1972"},{"key":"10.1016\/0010-4485(93)90084-2_BIB10","series-title":"Proc. 19th Design Automation Conf.","first-page":"175","article-title":"A linear-time heuristic for improving network partitions","author":"Fiduccia","year":"1982"},{"key":"10.1016\/0010-4485(93)90084-2_BIB11","series-title":"Proc. Int. Conf. Computer Design","first-page":"122","article-title":"Heuristic improvement technique for bisection of VLSI networks","author":"Goldberg","year":"1983"},{"key":"10.1016\/0010-4485(93)90084-2_BIB12","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TC.1984.1676460","article-title":"An improved min-cut algorithm for partitioning VLSI networks","volume":"Vol C-33","author":"Krishnamurthy","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0010-4485(93)90084-2_BIB13","series-title":"Proc. Int. Conf. Computer-Aided Design","first-page":"470","article-title":"Improvements of a mincut partition algorithm","author":"Ng","year":"1987"},{"key":"10.1016\/0010-4485(93)90084-2_BIB14","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/12.8730","article-title":"Multiple-way network partitioning","volume":"Vol C-38","author":"Sanchis","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0010-4485(93)90084-2_BIB15","series-title":"Proc. 17th Design Automation Conf.","first-page":"458","article-title":"Efficient placement and routing for masterslice LSI","author":"Shiraishi","year":"1980"},{"key":"10.1016\/0010-4485(93)90084-2_BIB16","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/0010-4485(89)90159-0","article-title":"Efficient algorithm for graph-partitioning problem using a problem transformation method","volume":"Vol 21","author":"Lee","year":"1989","journal-title":"Comput.-Aided Des."},{"key":"10.1016\/0010-4485(93)90084-2_BIB17","doi-asserted-by":"crossref","first-page":"1112","DOI":"10.1109\/TC.1987.5009543","article-title":"Constructing test cases for partitioning heuristics","volume":"Vol C-36","author":"Krishnamurthy","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0010-4485(93)90084-2_BIB18","series-title":"Fundamentals of Computer Algorithms","author":"Horowitz","year":"1978"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0010448593900842?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0010448593900842?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T20:26:08Z","timestamp":1553631968000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0010448593900842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,5]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1993,5]]}},"alternative-id":["0010448593900842"],"URL":"https:\/\/doi.org\/10.1016\/0010-4485(93)90084-2","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[1993,5]]}}}