{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:40:16Z","timestamp":1759138816996,"version":"3.44.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":["Integration"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0167-9260(03)00032-4","type":"journal-article","created":{"date-parts":[[2003,7,31]],"date-time":"2003-07-31T19:44:52Z","timestamp":1059680692000},"page":"55-68","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["An improved circuit-partitioning algorithm based on min-cut equivalence relation"],"prefix":"10.1016","volume":"36","author":[{"given":"Xianyang","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xubang","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianxu","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huayu","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1\u20132","key":"10.1016\/S0167-9260(03)00032-4_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","article-title":"Recent directions in netlist partitioning","volume":"19","author":"Alpert","year":"1995","journal-title":"VLSI J."},{"year":"1994","series-title":"Introduction to Parallel Computing, Design and Analysis of Algorithms","author":"Kumar","key":"10.1016\/S0167-9260(03)00032-4_BIB2"},{"year":"1979","series-title":"Computers and Intractability","author":"Garey","key":"10.1016\/S0167-9260(03)00032-4_BIB3"},{"key":"10.1016\/S0167-9260(03)00032-4_BIB4","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning of electrical circuits","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Systems Tech. J."},{"key":"10.1016\/S0167-9260(03)00032-4_BIB5","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia, R.M. Mattheyses, Alinear time heuristic for improving network partitions, in: Proceedings of the ACM\/IEEE Design Automation Conference, 1982, pp. 175\u2013181.","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"1","key":"10.1016\/S0167-9260(03)00032-4_BIB6","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/12.8730","article-title":"Multiple-way network partitioning","volume":"38","author":"Sanchis","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"10.1016\/S0167-9260(03)00032-4_BIB7","doi-asserted-by":"crossref","first-page":"1500","DOI":"10.1109\/12.260640","article-title":"Multiple-way network partitioning with different cost functions","volume":"42","author":"Sanchis","year":"1993","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0167-9260(03)00032-4_BIB8","unstructured":"J. Greene, K. Supowit, Simulated annealing without rejected moves, in: Proceedings of the IEEE International Conference on Computer Design, 1984, pp. 658\u2013663."},{"key":"10.1016\/S0167-9260(03)00032-4_BIB9","series-title":"Modern Heuristic Techniques for Combinatorial Problems","first-page":"20","article-title":"Simulated annealing","author":"Dowsland","year":"1993"},{"key":"10.1016\/S0167-9260(03)00032-4_BIB10","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/S0167-739X(98)00045-4","article-title":"Annealing-based heuristics and genetic algorithms for circuit partitioning in parallel test generation","volume":"14","author":"Gil","year":"1998","journal-title":"Future Generation Comput. Systems"},{"key":"10.1016\/S0167-9260(03)00032-4_BIB11","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing","volume":"37","author":"Johnson","year":"1989","journal-title":"Oper. Res."},{"issue":"7","key":"10.1016\/S0167-9260(03)00032-4_BIB12","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1109\/12.508322","article-title":"Genetic algorithm and graph partitioning","volume":"45","author":"Bui","year":"1996","journal-title":"IEEE Trans. Comput."},{"issue":"3","key":"10.1016\/S0167-9260(03)00032-4_BIB13","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/43.700718","article-title":"GRCA","volume":"17","author":"Bui","year":"1998","journal-title":"IEEE Trans. Comput. Aided Des. Integrated Circuits Systems"},{"issue":"12","key":"10.1016\/S0167-9260(03)00032-4_BIB14","first-page":"1533","article-title":"Efficient network flow based min-cut balanced partitioning","volume":"15","author":"Yang","year":"1996","journal-title":"IEEE Trans. Comput Aided Des. Integrated Circuits Systems"},{"issue":"1","key":"10.1016\/S0167-9260(03)00032-4_BIB15","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/43.673632","article-title":"Network-flow-based multiway partitioning with area and pin constraints","volume":"17","author":"Liu","year":"1998","journal-title":"IEEE Trans. Comput. Aided Des. Integrated Circuits Systems"},{"issue":"3","key":"10.1016\/S0167-9260(03)00032-4_BIB16","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1109\/92.238449","article-title":"A simple yet effective technique for partitioning","volume":"1","author":"Shin","year":"1993","journal-title":"IEEE Trans. VLSI Systems"},{"key":"10.1016\/S0167-9260(03)00032-4_BIB17","doi-asserted-by":"crossref","unstructured":"R. Rajaraman, D.F. Wong, Optimal clustering for delay minimization, in: Proceedings of the 30th ACM\/IEEE Design Automation Conference, 1993, pp. 309\u2013314.","DOI":"10.1145\/157485.164907"},{"issue":"9","key":"10.1016\/S0167-9260(03)00032-4_BIB18","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1109\/43.658566","article-title":"Circuit clustering for delay minimization under area and pin constraints","volume":"16","author":"Yang","year":"1997","journal-title":"IEEE Trans. Comput. Aided Des. Integrated Circuits Systems"},{"key":"10.1016\/S0167-9260(03)00032-4_BIB19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-9260(00)00008-0","article-title":"Afast hypergraph min-cut algorithm for circuit partitioning","volume":"30","author":"Wai-kei Mak","year":"2000","journal-title":"Integration VLSI J."},{"issue":"1","key":"10.1016\/S0167-9260(03)00032-4_BIB20","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1109\/43.363121","article-title":"Min-cut replication in partitioned networks","volume":"14","author":"Hwang","year":"1995","journal-title":"IEEE Trans. Comput. Aid Des."},{"issue":"9","key":"10.1016\/S0167-9260(03)00032-4_BIB21","doi-asserted-by":"crossref","first-page":"1237","DOI":"10.1109\/43.784117","article-title":"Evaluation and optimization of replication algorithms for logic partitioning","volume":"18","author":"Enos","year":"1999","journal-title":"IEEE Trans. Comput. Aided Des. Integrated Circuits Systems."},{"key":"10.1016\/S0167-9260(03)00032-4_BIB22","unstructured":"R. Murgai, R.K. Brayton, A. Sangiovanni-Vincentelli, On clustering for minimum delay\/area, in: Proceedings of the IEEE International Conference on Computer-Aided Design, 1991, pp. 6\u20139."},{"issue":"11","key":"10.1016\/S0167-9260(03)00032-4_BIB23","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1109\/43.736190","article-title":"Optimal min-area min-cut replication in partitioned circuits","volume":"17","author":"Yang","year":"1998","journal-title":"IEEE Trans. Comput. Aided Des. Integrated Circuits Systems"},{"key":"10.1016\/S0167-9260(03)00032-4_BIB24","doi-asserted-by":"crossref","unstructured":"C. Kring, A.R. Newton, Acell-replicating approach to mincut-based circuit partitioning, in: Proceedings of the IEEE International Conference on Computer-Aided Design, 1991, pp. 2\u20135.","DOI":"10.1109\/ICCAD.1991.185175"},{"key":"10.1016\/S0167-9260(03)00032-4_BIB25","doi-asserted-by":"crossref","unstructured":"J. Hwang, A. El Gamal, Optimal replication for min-cut partitioning, in: Proceedings of the IEEE International Conference on Computer-Aided Design, 1992, pp. 432\u2013435.","DOI":"10.1109\/ICCAD.1992.279332"},{"year":"1962","series-title":"Flows in Networks","author":"Ford","key":"10.1016\/S0167-9260(03)00032-4_BIB26"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926003000324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926003000324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:11:58Z","timestamp":1759137118000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926003000324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":26,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0167926003000324"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(03)00032-4","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[2003,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An improved circuit-partitioning algorithm based on min-cut equivalence relation","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(03)00032-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2003 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}