{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T07:45:51Z","timestamp":1751874351901},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540658313"},{"type":"electronic","value":"9783540489320"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/bfb0097983","type":"book-chapter","created":{"date-parts":[[2006,11,24]],"date-time":"2006-11-24T09:45:17Z","timestamp":1164361517000},"page":"986-995","source":"Crossref","is-referenced-by-count":5,"title":["Hybridizing nested dissection and halo approximate minimum degree for efficient sparce matrix ordering"],"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"}]},{"given":"Patrick","family":"Amestoy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,28]]},"reference":[{"key":"101_CR1","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1137\/S0895479894278952","volume":"17","author":"P. Amestoy","year":"1996","unstructured":"P. Amestoy, T. Davis, and I. Duff. An approximate minimum degree ordering algorithm. SIAM J. Matrix Anal. and Appl., 17:886\u2013905, 1996.","journal-title":"SIAM J. Matrix Anal. and Appl."},{"unstructured":"P. Amestoy, I. Duff, and J.-Y. L\u2019Excellent. Multifrontal parallel distributed symmetric and unsymmetric solvers. to appear in special issue of Comput. Methods in Appl. Mech. Eng. on domain decomposition and parallel computing, 1998.","key":"101_CR2"},{"issue":"6","key":"101_CR3","doi-asserted-by":"publisher","first-page":"1404","DOI":"10.1137\/0916081","volume":"16","author":"C. Ashcraft","year":"1995","unstructured":"C. Ashcraft. Compressed graphs and the minimum degree algorithm. SIAM J. Sci. Comput., 16(6):1404\u20131411, 1995.","journal-title":"SIAM J. Sci. Comput."},{"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.","key":"101_CR4","DOI":"10.21236\/ADA228143"},{"key":"101_CR5","doi-asserted-by":"publisher","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":"4","key":"101_CR6","doi-asserted-by":"publisher","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":"101_CR7","doi-asserted-by":"publisher","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"},{"unstructured":"A. George and J. W.-H. Liu. Computer solution of large sparse positive definite systems. Prentice Hall, 1981.","key":"101_CR8"},{"key":"101_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/1031001","volume":"31","author":"A. George","year":"1989","unstructured":"A. George and J. W.-H. Liu. The evolution of the minimum degree ordering algorithm. SIAM Review, 31:1\u201319, 1989.","journal-title":"SIAM Review"},{"key":"101_CR10","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/355705.355707","volume":"2","author":"N. E. Gibbs","year":"1976","unstructured":"N. E. Gibbs, W. G. Poole, and P. K. Stockmeyer. A comparison of several bandwidth and profile reduction algorithms. ACM Trans. Math. Soft., 2:322\u2013330, 1976.","journal-title":"ACM Trans. Math. Soft."},{"unstructured":"A. Gupta, G. Karypis, and V. Kumar. Scalable parallel algorithms for sparse linear systems. In Proc. Stratagem\u201996, Sophia-Antipolis, pages 97\u2013110, July 1996.","key":"101_CR11"},{"issue":"2","key":"101_CR12","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/S1064827596300656","volume":"20","author":"B. Hendrickson","year":"1998","unstructured":"B. Hendrickson and E. Rothberg. Improving the runtime and quality of nested dissection ordering. SIAM J. Sci. Comput., 20(2):468\u2013489, 1998.","journal-title":"SIAM J. Sci. Comput."},{"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":"101_CR13"},{"unstructured":"G. Karypis and V. Kumar. MeTis\u2014A Software Package for Partitioning Unstructured Graphs, Partitioning Meshes, and Computing Fill-Reducing Orderings of Sparse Matrices\u2014Version 4.0. University of Minnesota, September 1998.","key":"101_CR14"},{"issue":"2","key":"101_CR15","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R. J. Lipton","year":"1979","unstructured":"R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM Journal of Numerical Analysis, 16(2):346\u2013358, April 1979.","journal-title":"SIAM Journal of Numerical Analysis"},{"issue":"2","key":"101_CR16","doi-asserted-by":"publisher","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"},{"doi-asserted-by":"crossref","unstructured":"F. Pellegrini and J. Roman. Sparse matrix ordering with scotch. In Proceedings of HPCN\u201997, Vienna, LNCS 1225, pages 370\u2013378, April 1997.","key":"101_CR17","DOI":"10.1007\/BFb0031609"},{"unstructured":"R. Schreiber. Scalability of sparse direct solvers. Technical Report TR 92.13, RIACS, NASA Ames Research Center, May 1992.","key":"101_CR18"},{"key":"101_CR19","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1109\/PROC.1967.6011","volume":"55","author":"W. F. Tinney","year":"1967","unstructured":"W. F. Tinney and J. W. Walker. Direct solutions of sparse network equations by optimally ordered triangular factorization. J. Proc. IEEE, 55:1801\u20131809, 1967.","journal-title":"J. Proc. IEEE"}],"container-title":["Lecture Notes in Computer Science","Parallel and Distributed Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0097983","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T10:58:30Z","timestamp":1555930710000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0097983"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540658313","9783540489320"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0097983","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}