{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T10:21:13Z","timestamp":1773224473080,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540611424","type":"print"},{"value":"9783540499558","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61142-8_588","type":"book-chapter","created":{"date-parts":[[2006,7,12]],"date-time":"2006-07-12T11:41:08Z","timestamp":1152704468000},"page":"493-498","source":"Crossref","is-referenced-by-count":204,"title":["Scotch: A software package for static mapping by dual recursive bipartitioning of process and architecture graphs"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Pellegrini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Roman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,8,18]]},"reference":[{"issue":"2","key":"66_CR1","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1002\/cpe.4330060203","volume":"6","author":"S. T. Barnard","year":"1994","unstructured":"S. T. Barnard and H. D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6(2): 101\u2013117, 1994.","journal-title":"Concurrency: Practice and Experience"},{"key":"66_CR2","first-page":"35","volume":"10","author":"F. Ercal","year":"1990","unstructured":"F. Ercal, J. Ramanujam, and P. Sadayappan. Task allocation onto a hypercube by recursive mincut bipartitionning. JPDC, 10:35\u201344, 1990.","journal-title":"JPDC"},{"key":"66_CR3","doi-asserted-by":"crossref","unstructured":"C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In Proc. 19th Design Autom. Conf., pages 175\u2013181. IEEE, 1982.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"66_CR4","volume-title":"Computers and Intractablility: A Guide to the Theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractablility: A Guide to the Theory of NP-completeness. W. H. Freeman, San Francisco, 1979."},{"key":"66_CR5","unstructured":"S. W. Hammond. Mapping unstructured grid computations to massively parallel computers. PhD thesis, Rensselaer Polytechnic Institute, feb 1992."},{"key":"66_CR6","doi-asserted-by":"crossref","unstructured":"B. Hendrickson and R. Leland. The Chaco user's guide. Technical Report SAND93-2339, Sandia National Laboratories, nov 1993.","DOI":"10.2172\/10106339"},{"key":"66_CR7","unstructured":"B. Hendrickson and R. Leland. An empirical study of static load balancing algorithms. In Proceedings of SHPCC'94, Knoxville, pages 682\u2013685. IEEE, may 1994."},{"key":"66_CR8","unstructured":"G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. TR 95-035, University of Minnesota, jun 1995."},{"key":"66_CR9","unstructured":"G. Karypis and V. Kumar. MeTiS \u2014 Unstructured Graph Partitioning and Sparse Matrix Ordering System \u2014 Version 2.0. University of Minnesota, jun 1995."},{"key":"66_CR10","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jpdc.1994.1126","volume":"23","author":"D. M. Nicol","year":"1994","unstructured":"D. M. Nicol. Rectilinear partitioning of irregular data parallel computations. Journal of Parallel and Distributed Computing, 23:119\u2013134, 1994.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"66_CR11","unstructured":"F. Pellegrini. Application de m\u00e9thodes de partition \u00e0 la r\u00e9solution de probl\u00e8mes de graphes issus du parall\u00e9lisme. Th\u00e8se de Doctorat, Universit\u00e9 Bordeaux I, jan 1995."},{"key":"66_CR12","unstructured":"F. Pellegrini. Scotch 3.0 User's guide. Technical Report 1095-95, LaBRI, Universit\u00e9 Bordeaux I, oct 1995."},{"issue":"3","key":"66_CR13","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal of Matrix Analysis, 11(3):430\u2013452, jul 1990.","journal-title":"SIAM Journal of Matrix Analysis"}],"container-title":["Lecture Notes in Computer Science","High-Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61142-8_588","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T20:22:58Z","timestamp":1555705378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61142-8_588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611424","9783540499558"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-61142-8_588","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}