{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:23:56Z","timestamp":1757629436622,"version":"3.44.0"},"reference-count":35,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1991,11,1]],"date-time":"1991-11-01T00:00:00Z","timestamp":688953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1991,11]]},"DOI":"10.1016\/0743-7315(91)90074-j","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"257-272","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":28,"title":["Parallelism in graph-partitioning"],"prefix":"10.1016","volume":"13","author":[{"given":"John E.","family":"Savage","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus G.","family":"Wloka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"journal-title":"Thinking Machines Corp. TMC Tech. Rep. HA 87-4","year":"1987","key":"10.1016\/0743-7315(91)90074-J_BIB1"},{"issue":"1","key":"10.1016\/0743-7315(91)90074-J_BIB2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/71.80128","article-title":"Parallel simulated annealing algorithms for cell placement on hypercube multiprocessors","volume":"PDS-1","author":"Banerjee","year":"1990","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"issue":"11","key":"10.1016\/0743-7315(91)90074-J_BIB3","doi-asserted-by":"crossref","first-page":"1526","DOI":"10.1109\/12.42122","article-title":"Scans as primitive parallel operations","volume":"38","author":"Blelloch","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/0743-7315(91)90074-J_BIB4","first-page":"343","article-title":"Min-cut placement","volume":"1","author":"Breuer","year":"1977","journal-title":"Design Automat. Fault-Tolerant Comput."},{"key":"10.1016\/0743-7315(91)90074-J_BIB5","series-title":"25th Annual Symposium on Foundations of Computer Science","first-page":"181","article-title":"Graph bisection algorithms with good average case behavior","author":"Bui","year":"1984"},{"issue":"3","key":"10.1016\/0743-7315(91)90074-J_BIB6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","article-title":"Graph bisection algorithms with good average case behavior","volume":"7","author":"Bui","year":"1987","journal-title":"Combinatorica"},{"key":"10.1016\/0743-7315(91)90074-J_BIB7","series-title":"26th IEEE Design Automation Conference","first-page":"775","article-title":"Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms","author":"Bui","year":"1989"},{"article-title":"On bisecting random graphs","year":"1983","author":"Bui","key":"10.1016\/0743-7315(91)90074-J_BIB8"},{"key":"10.1016\/0743-7315(91)90074-J_BIB9","series-title":"25th IEEE Design Automation Conference","first-page":"134","article-title":"Mask verification on the connection machine","author":"Carlson","year":"1988"},{"key":"10.1016\/0743-7315(91)90074-J_BIB10","first-page":"350","article-title":"Placement of standard cells using simulated annealing on the connection machine","author":"Casotto","year":"1987","journal-title":"ICCAD"},{"key":"10.1016\/0743-7315(91)90074-J_BIB11","series-title":"Proceedings International Conference on Parallel Processing","first-page":"9","article-title":"Optimal parallel algorithms for river routing","author":"Chang","year":"1988"},{"key":"10.1016\/0743-7315(91)90074-J_BIB12","series-title":"Proceedings International Conference on Parallel Processing","first-page":"18","article-title":"Parallel algorithms for channeling routing in the knock-knee model","author":"Chang","year":"1988"},{"issue":"3","key":"10.1016\/0743-7315(91)90074-J_BIB13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1147\/rd.313.0391","article-title":"Parallel algorithms for chip placement by simulated annealing","volume":"31","author":"Darema","year":"1987","journal-title":"IBM J. Res. Develop."},{"issue":"1","key":"10.1016\/0743-7315(91)90074-J_BIB14","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TCAD.1985.1270101","article-title":"A procedure for placement of standard-cell VLSI circuits","volume":"CAD4","author":"Dunlop","year":"1985","journal-title":"IEEE Trans. Computer-Aided Design"},{"key":"10.1016\/0743-7315(91)90074-J_BIB15","series-title":"19th IEEE Design Automation Conference","first-page":"175","article-title":"A linear-time heuristic for improving network partitions","author":"Fiduccia","year":"1982"},{"year":"1979","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","key":"10.1016\/0743-7315(91)90074-J_BIB16"},{"issue":"4","key":"10.1016\/0743-7315(91)90074-J_BIB17","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J Comput."},{"issue":"2","key":"10.1016\/0743-7315(91)90074-J_BIB18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","article-title":"The monotone and planar circuit value problems","volume":"9","author":"Goldschlager","year":"1977","journal-title":"ACM SIGACT News"},{"issue":"1","key":"10.1016\/0743-7315(91)90074-J_BIB19","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(80)90117-9","article-title":"A space efficient algorithm for the monotone planar circuit value problem","volume":"10","author":"Goldschlager","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(91)90074-J_BIB20","article-title":"A taxonomy of parallel simulated annealing techniques","author":"Greening","year":"1989","journal-title":"IBM, Tech. Rep. RC 14884"},{"year":"1985","series-title":"The Connection Machine","author":"Hillis","key":"10.1016\/0743-7315(91)90074-J_BIB21"},{"issue":"6","key":"10.1016\/0743-7315(91)90074-J_BIB22","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: An experimental evaluation (part 1)","volume":"37","author":"Johnson","year":"1989","journal-title":"Oper. Res."},{"key":"10.1016\/0743-7315(91)90074-J_BIB23","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","article-title":"How easy is local search?","volume":"37","author":"Johnson","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0743-7315(91)90074-J_BIB24","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":"49","author":"Kernighan","year":"1970","journal-title":"AT&T Bell Labs. Tech. J."},{"issue":"4598","key":"10.1016\/0743-7315(91)90074-J_BIB25","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"issue":"5","key":"10.1016\/0743-7315(91)90074-J_BIB26","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":"33","author":"Krishnamurthy","year":"1984","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"10.1016\/0743-7315(91)90074-J_BIB27","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/990518.990519","article-title":"The circuit value problem is log space complete for P","volume":"7","author":"Ladner","year":"1975","journal-title":"ACM SIGACT News"},{"key":"10.1016\/0743-7315(91)90074-J_BIB28","first-page":"510","article-title":"Simulated annealing: A fast heuristic for some generic layout problems","author":"Lam","year":"1988","journal-title":"ICCAD"},{"key":"10.1016\/0743-7315(91)90074-J_BIB29","series-title":"14th Annual ACM Symposium on Theory of Computing","first-page":"85","article-title":"A layout strategy for VLSI which is probably good","author":"Leighton","year":"1982"},{"year":"1976","series-title":"The Complexity of Computing","author":"Savage","key":"10.1016\/0743-7315(91)90074-J_BIB30"},{"key":"10.1016\/0743-7315(91)90074-J_BIB31","series-title":"Proceedings of the ICALP'90","first-page":"476","article-title":"On parallelizing graph-partitioning heuristics","volume":"Vol. 443","author":"Savage","year":"1990"},{"key":"10.1016\/0743-7315(91)90074-J_BIB32","first-page":"288","article-title":"A parallel algorithm for channel routing","author":"Savage","year":"1988"},{"key":"10.1016\/0743-7315(91)90074-J_BIB33","series-title":"Advanced Research in VSLI: Proceedings of the 1989 Decennial Caltech Conference","first-page":"241","article-title":"Parallel constraint graph generation","author":"Savage","year":"1989"},{"year":"1990","series-title":"Simple local search problems that are hard to solve","author":"Sch\u00e4ffer","key":"10.1016\/0743-7315(91)90074-J_BIB34"},{"key":"10.1016\/0743-7315(91)90074-J_BIB35","series-title":"Proceedings of the International Conference on Computer Design","first-page":"78","article-title":"Simulated annealing-based, circuit placement on the connection machine","author":"Wong","year":"1987"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190074J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159190074J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:02Z","timestamp":1757514602000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159190074J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,11]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,11]]}},"alternative-id":["074373159190074J"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(91)90074-j","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1991,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Parallelism in graph-partitioning","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(91)90074-J","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1991 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}