{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:21:20Z","timestamp":1773224480569,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"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":["Parallel Computing"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1016\/s0167-8191(00)00046-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:32:20Z","timestamp":1027607540000},"page":"1635-1660","source":"Crossref","is-referenced-by-count":65,"title":["Parallel optimisation algorithms for multilevel mesh partitioning"],"prefix":"10.1016","volume":"26","author":[{"given":"C.","family":"Walshaw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Cross","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(00)00046-6_BIB1","doi-asserted-by":"crossref","unstructured":"S.T. Barnard, PMRSB: Parallel multilevel recursive spectral bisection, Cray Res. Inc., 1996","DOI":"10.1145\/224170.224227"},{"issue":"2","key":"10.1016\/S0167-8191(00)00046-6_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/cpe.4330060203","article-title":"A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems","volume":"6","author":"Barnard","year":"1994","journal-title":"Concurrency: Practice Experience"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB3","unstructured":"R. Biswas, L. Oliker, Experiments with repartitioning and load balancing adaptive meshes, Technical Report NAS-97-021, NASA Ames, Moffat Field, CA, 1997"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB4","doi-asserted-by":"crossref","unstructured":"P. Buch, J. Sanghavi, A. Sangiovanni-Vincentelli, A parallel graph partitioner on a distributed memory multiprocessor, in: Proceedings of the Fifth IEEE Symposium on Frontiers of Massively Parallel Computation, IEEE, 1995, pp. 360\u2013366","DOI":"10.1109\/FMPC.1995.380434"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB5","series-title":"Parallel Processing for Scientific Computing","first-page":"445","article-title":"A heuristic for reducing fill-in in sparse matrix factorization","author":"Bui","year":"1993"},{"issue":"2","key":"10.1016\/S0167-8191(00)00046-6_BIB6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","article-title":"Dynamic load balancing for distributed memory multiprocessors","volume":"7","author":"Cybenko","year":"1989","journal-title":"J. Parallel Distrib. Comput."},{"issue":"7","key":"10.1016\/S0167-8191(00)00046-6_BIB7","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1016\/S0167-8191(99)00018-6","article-title":"Efficient schemes for nearest neighbor load balancing","volume":"25","author":"Diekmann","year":"1999","journal-title":"Parallel Computing"},{"issue":"1","key":"10.1016\/S0167-8191(00)00046-6_BIB8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1002\/(SICI)1096-9128(199801)10:1<53::AID-CPE288>3.0.CO;2-W","article-title":"Parallel decomposition of unstructured FEM-meshes","volume":"10","author":"Diekmann","year":"1998","journal-title":"Concurrency: Practice Experience"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB9","series-title":"Parallel Processing for Scientific Computing","first-page":"615","article-title":"Parallel algorithms for dynamically partitioning unstructured grids","author":"Diniz","year":"1995"},{"issue":"5","key":"10.1016\/S0167-8191(00)00046-6_BIB10","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/0045-7949(88)90004-1","article-title":"A simple and efficient automatic FEM domain decomposer","volume":"28","author":"Farhat","year":"1988","journal-title":"Comput. Struct."},{"key":"10.1016\/S0167-8191(00)00046-6_BIB11","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia, R.M. Mattheyses, A linear time heuristic for improving network partitions, in: Proceedings of the 19th IEEE Design Automation Conference, IEEE, Piscataway, NJ, 1982, pp. 175\u2013181","DOI":"10.1109\/DAC.1982.1585498"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB12","unstructured":"B. Ghosh, S. Muthukrishnan, M.H. Schultz, Faster schedules for diffusive load balancing via over-relaxation, Technical Report 1065, Department of Computer Science, Yale University, New Haven, CT 06520, USA, 1995"},{"issue":"6","key":"10.1016\/S0167-8191(00)00046-6_BIB13","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/BF01388998","article-title":"A parallel graph partitioning algorithm for a message-passing multiprocessor","volume":"16","author":"Gilbert","year":"1987","journal-title":"Int. J. Parallel Prog."},{"issue":"1\/2","key":"10.1016\/S0167-8191(00)00046-6_BIB14","first-page":"171","article-title":"Fast and effective algorithms for graph partitioning and sparse matrix reordering","volume":"41","author":"Gupta","year":"1996","journal-title":"IBM J. Res. Dev."},{"key":"10.1016\/S0167-8191(00)00046-6_BIB15","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, Graph partitioning and parallel solvers: Has the emperor no clothes? in: A. Ferreira, J. Rolim (Eds.), Proceedings Irregular '98: Parallel Algorithms for Irregularly Structured Problems, vol. 1457 of LNCS, Springer, 1998, pp. 218\u2013225","DOI":"10.1007\/BFb0018541"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB16","unstructured":"B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, Technical Report SAND 93-1301, Sandia National Labs, Albuquerque, NM, 1993"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB17","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, in: S. Karin (Ed.), Proceedings of Supercomputing'95, San Diego, CA, ACM Press, New York, 1995","DOI":"10.1145\/224170.224228"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB18","unstructured":"Y.F. Hu, R.J. Blake, The optimal property of polynomial based diffusion-like algorithms in dynamic load balancing, in: K.D. Papailiou et al. (Ed.), Computational Dynamics '98, Wiley, New York, 1998, pp. 177\u2013183"},{"issue":"6","key":"10.1016\/S0167-8191(00)00046-6_BIB19","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1002\/(SICI)1096-9128(199805)10:6<467::AID-CPE325>3.0.CO;2-A","article-title":"An optimal migration algorithm for dynamic load balancing","volume":"10","author":"Hu","year":"1998","journal-title":"Concurrency: Practice Experience"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB20","doi-asserted-by":"crossref","unstructured":"G. Karypis, V. Kumar, Multilevel k-way partitioning scheme for irregular graphs, J. Par. Dist. Comput. 48 (1) (1998) 96\u2013129","DOI":"10.1006\/jpdc.1997.1404"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB21","series-title":"Parallel Processing for Scientific Computing","article-title":"A coarse-grain parallel formulation of multilevel k-way graph partitioning algorithm","author":"Karypis","year":"1997"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB22","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Sys. Tech. J."},{"key":"10.1016\/S0167-8191(00)00046-6_BIB23","doi-asserted-by":"crossref","unstructured":"D.E. Keyes, D.K. Kaushik, B.F. Smith, Prospects for CFD on Petaflops Systems, in: M. Hafez, K. Oshima (Ed.), CFD Review 1998, World Scientific, Singapore, 1998, pp. 1079\u20131096","DOI":"10.1142\/9789812812957_0060"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB24","doi-asserted-by":"crossref","unstructured":"R. Lohner, R. Ramamurti, D. Martin, A parallelizable load balancing algorithm, AIAA-93-0061, American Institute of Aeronautics and Astronautics, Washington, DC, 1993","DOI":"10.2514\/6.1993-61"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB25","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0743-7315(91)90074-J","article-title":"Parallelism in graph partitioning","volume":"13","author":"Savage","year":"1991","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"10.1016\/S0167-8191(00)00046-6_BIB26","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/jpdc.1997.1410","article-title":"Multilevel diffusion schemes for repartitioning of adaptive meshes","volume":"47","author":"Schloegel","year":"1997","journal-title":"J. Parallel Distrib. Comput."},{"issue":"1\/2","key":"10.1016\/S0167-8191(00)00046-6_BIB27","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1109\/2.179115","article-title":"Load distributing for locally distributed systems","volume":"25","author":"Shivaratri","year":"1992","journal-title":"IEEE Comput."},{"issue":"1\/2","key":"10.1016\/S0167-8191(00)00046-6_BIB28","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1006\/jpdc.1998.1445","article-title":"HARP: A dynamic spectral partitioner","volume":"50","author":"Simon","year":"1998","journal-title":"J. Parallel Distrib. Comput."},{"issue":"6","key":"10.1016\/S0167-8191(00)00046-6_BIB29","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1016\/0167-8191(94)90120-1","article-title":"A partially asynchronous and iterative algorithm for distributed load balancing","volume":"20","author":"Song","year":"1994","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(00)00046-6_BIB30","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1002\/nme.1620380306","article-title":"Optimized partitioning of unstructured computational grids","volume":"38","author":"Vanderstraeten","year":"1995","journal-title":"Int. J. Numer. Meth. Engrg."},{"key":"10.1016\/S0167-8191(00)00046-6_BIB31","doi-asserted-by":"crossref","unstructured":"C. Walshaw, M. Cross, Mesh partitioning: a multilevel balancing and refinement algorithm, SIAM J. Sci. Comput. 22 (1) (2000) 63\u201380","DOI":"10.1137\/S1064827598337373"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB32","unstructured":"C. Walshaw, M. Cross, Parallel optimisation algorithms for multilevel mesh partitioning, Technical Report 99\/IM\/44, University of Greenwich, London SE18 6PF, UK, February 1999"},{"key":"10.1016\/S0167-8191(00)00046-6_BIB33","doi-asserted-by":"crossref","unstructured":"C. Walshaw, M. Cross, R. Diekmann, F. Schlimbach, Multilevel Mesh Partitioning for Optimising Domain Shape, Int. J. High Performance Comput. Appl. 13 (4) (1999) 334\u2013353","DOI":"10.1177\/109434209901300404"},{"issue":"2","key":"10.1016\/S0167-8191(00)00046-6_BIB34","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/jpdc.1997.1407","article-title":"Parallel dynamic graph partitioning for adaptive unstructured meshes","volume":"47","author":"Walshaw","year":"1997","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100000466?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819100000466?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T03:04:19Z","timestamp":1733281459000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819100000466"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":34,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["S0167819100000466"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(00)00046-6","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}