{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T05:29:34Z","timestamp":1774416574796,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540628989","type":"print"},{"value":"9783540690412","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0031609","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T07:45:51Z","timestamp":1134287151000},"page":"370-378","source":"Crossref","is-referenced-by-count":11,"title":["Sparse matrix ordering with Scotch"],"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,6,25]]},"reference":[{"key":"36_CR1","unstructured":"P. Amestoy, T. Davis, and I. Duff. An approximate minimum degree ordering algorithm. Technical Report RT\/APO\/95\/5, ENSEEIHT-IRIT, 1995. To appear in SIAM Journal of Matrix Analysis and Applications."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"C. Ashcraft, S. Eisenstat, J. W.-H. Liu, and A. Sherman. A comparison of three column based distributed sparse factorization schemes. In Proc. Fifth SIAM Conf. on Parallel Processing for Scientific Computing, 1991.","DOI":"10.21236\/ADA228143"},{"issue":"2","key":"36_CR3","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":"36_CR4","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF01396049","volume":"55","author":"P. Charrier","year":"1989","unstructured":"P. Charrier and J. Roman. Algorithmique et calculs de complexit\u00e9 pour un solveur de type dissections embo\u00eet\u00e9es. Numerische Mathematik, 55:463\u2013476, 1989.","journal-title":"Numerische Mathematik"},{"issue":"3","key":"36_CR5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/355958.355963","volume":"7","author":"I. Duff","year":"1981","unstructured":"I. Duff. On algorithms for obtaining a maximum transversal. ACM Trans. Math. Software, 7(3):315\u2013330, September 1981.","journal-title":"ACM Trans. Math. Software"},{"key":"36_CR6","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"},{"issue":"4","key":"36_CR7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01407861","volume":"18","author":"G. A. Geist","year":"1989","unstructured":"G. A. Geist and E. G.-Y. Ng. Task scheduling for parallel sparse Cholesky factorization. International Journal of Parallel Programming, 18(4):291\u2013314, 1989.","journal-title":"International Journal of Parallel Programming"},{"key":"36_CR8","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1137\/0909021","volume":"9","author":"A. George","year":"1988","unstructured":"A. George, M. T. Heath, J. W.-H. Liu, and E. G.-Y. Ng. Sparse Cholesky factorization on a local memory multiprocessor. SIAM Journal on Scientific and Statistical Computing, 9:327\u2013340, 1988.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"key":"36_CR9","unstructured":"J. A. George and J. W.-H. Liu. Computer solution of large sparse positive definite systems. Prentice Hall, 1981."},{"key":"36_CR10","unstructured":"A. Gupta, G. Karypis, and V. Kumar. Highly scalable parallel algorithms for sparse matrix factorization. TR 94-063, University of Minnesota, 1994. To appear in IEEE Trans. on Parallel and Distributed Systems, 1997."},{"key":"36_CR11","first-page":"97","volume-title":"Proc. Stratagem'96","author":"A. Gupta","year":"1996","unstructured":"A. Gupta, G. Karypis, and V. Kumar. Scalable parallel algorithms for sparse linear systems. In Proc. Stratagem'96, Sophia-Antipolis, pages 97\u2013110. INRIA, July 1996."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"B. Hendrickson and R. Leland. The Chaco user's guide \u2014 version 2.0. Technical Report SAND94-2692, Sandia National Laboratories, 1994.","DOI":"10.2172\/10106339"},{"issue":"4","key":"36_CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J. Hopcroft","year":"1973","unstructured":"J. Hopcroft and R. Karp. An n 5\/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal of Computing, 2(4):225\u2013231, December 1973.","journal-title":"SIAM Journal of Computing"},{"key":"36_CR14","unstructured":"G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. TR 95-035, University of Minnesota, June 1995."},{"key":"36_CR15","unstructured":"G. Karypis and V. Kumar. MeTiS \u2014 Unstructured Graph Partitioning and Sparse Matrix Ordering System \u2014 Version 2.0. University of Minnesota, June 1995."},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"G. Karypis and V. Kumar. Parallel multilevel k-way partitioning scheme for irregular graphs. TR 96-036, University of Minnesota, 1996.","DOI":"10.1145\/369028.369103"},{"key":"36_CR17","volume-title":"Orderings for parallel sparse symmetric factorization","author":"C. Leiserson","year":"1987","unstructured":"C. Leiserson and J. Lewis. Orderings for parallel sparse symmetric factorization. In Third SIAM Conference on Parallel Processing for Scientific Computing, Troms\u00f8. SIAM, 1987."},{"issue":"2","key":"36_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","volume":"11","author":"J. W. Liu","year":"1985","unstructured":"J. W.-H. Liu. Modification of the minimum-degree algorithm by multiple elimination. ACM Trans. Math. Software, 11(2):141\u2013153, 1985.","journal-title":"ACM Trans. Math. Software"},{"key":"36_CR19","first-page":"486","volume-title":"Proc. SHPCC'94","author":"F. Pellegrini","year":"1994","unstructured":"F. Pellegrini. Static mapping by dual recursive bipartitioning of process and architecture graphs. In Proc. SHPCC'94, Knoxville, pages 486\u2013493. IEEE, May 1994."},{"key":"36_CR20","unstructured":"F. Pellegrini. Application of graph partitioning techniques to static mapping and domain decomposition. In ETPSC 3, Faverges-de-la-Tour, August 1996. To appear in a special issue of Parallel Computing."},{"key":"36_CR21","unstructured":"F. Pellegrini. Scotch 3.2 User's guide. Technical Report, LaBRI, Universit\u00e9 Bordeaux I, April 1997. Available at URL http:\/\/www.labri.u-bordeaux.fr\/\u223cpelegrin\/papers\/scotch_user3.2.ps.gz."},{"key":"36_CR22","first-page":"493","volume":"1067","author":"F. Pellegrini","year":"1996","unstructured":"F. Pellegrini and J. Roman. Scotch: A Software Package for Static Mapping by Dual Recursive Bipartitioning of Process and Architecture Graphs. In Proceedings of HPCN'96, Brussels, LNCS 1067, pages 493\u2013498, April 1996.","journal-title":"LNCS"},{"issue":"4","key":"36_CR23","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/98267.98287","volume":"16","author":"A. Pothen","year":"1990","unstructured":"A. Pothen and C.-J. Fan. Computing the block triangular form of a sparse matrix. ACM Trans. Math. Software, 16(4):303\u2013324, December 1990.","journal-title":"ACM Trans. Math. Software"},{"issue":"3","key":"36_CR24","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 eigen-vectors of graphs. SIAM Journal of Matrix Analysts, 11(3):430\u2013452, July 1990.","journal-title":"SIAM Journal of Matrix Analysts"},{"key":"36_CR25","first-page":"324","volume-title":"Proceedings of SH-PCC'94","author":"E. Rothberg","year":"1994","unstructured":"E. Rothberg. Performance of panel and block approaches to sparse Cholesky factorization on the iPSC\/860 and Paragon multicomputers. In Proceedings of SH-PCC'94, Knoxville, pages 324\u2013333. IEEE, May 1994."},{"key":"36_CR26","doi-asserted-by":"crossref","unstructured":"E. Rothberg and A. Gupta. An efficient block-oriented approach to parallel sparse Cholesky factorization. In Supercomputing'93 Proceedings. IEEE, 1993.","DOI":"10.1145\/169627.169791"},{"key":"36_CR27","doi-asserted-by":"crossref","unstructured":"E. Rothberg and R. Schreiber. Improved load distribution in parallel sparse Cholesky factorization. In Supercomputing'94 Proceedings. IEEE, 1994.","DOI":"10.1109\/SUPERC.1994.344344"},{"key":"36_CR28","unstructured":"R. Schreiber. Scalability of sparse direct solvers. Technical Report TR 92.13, RIACS, NASA Ames Research Center, May 1992."}],"container-title":["Lecture Notes in Computer Science","High-Performance Computing and Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0031609","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T13:53:16Z","timestamp":1586613196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0031609"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540628989","9783540690412"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/bfb0031609","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997]]}}}