{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:44Z","timestamp":1725664964631},"publisher-location":"Berlin, Heidelberg","reference-count":74,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631385"},{"type":"electronic","value":"9783540691570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63138-0_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:07:50Z","timestamp":1330297670000},"page":"255-272","source":"Crossref","is-referenced-by-count":0,"title":["Parallel sparse Cholesky factorization"],"prefix":"10.1007","author":[{"given":"Burkhard","family":"Monien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Schulze","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"22_CR1","unstructured":"F.L. Alvarado, A. Pothen, R. Schreiber, Highly parallel sparse triangular solution, RIACS Techn. Rep. 92.11, NASA Ames Research Center, 1992."},{"key":"22_CR2","volume-title":"Techn. Rep. TR\/PA\/95\/09","author":"P. Amestoy","year":"1995","unstructured":"P. Amestoy, T.A. Davis, I.S. Duff, An approximate minimum degree ordering algorithm, Techn. Rep. TR\/PA\/95\/09, Parallel Algorithm Project, CERFACS, Toulouse, 1995."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"C. Ashcraft, S.C. Eisenstat, J.W.H. Liu, A. Sherman, A comparison of three distributed sparse factorization schemes, SIAM Symposium on Sparse Matrices, 1989.","DOI":"10.21236\/ADA228143"},{"issue":"No.3","key":"22_CR4","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1137\/0911033","volume":"11","author":"C. Ashcraft","year":"1990","unstructured":"C. Ashcraft, S.C. Eisenstat, J.W.H. Liu, A fan-in algorithm for distributed sparse numerical factorization, SIAM J. Sci. Stat. Comput., Vol. 11, No. 3, 593\u2013599, 1990.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"22_CR5","volume-title":"Techn. Rep. ISSTECH-95-024","author":"C. Ashcraft","year":"1995","unstructured":"C. Ashcraft, J.W.H. Liu, Using domain decomposition to find graph bisectors, Techn. Rep. ISSTECH-95-024, Boeing Computer Services, Seattle, 1995."},{"key":"22_CR6","volume-title":"Techn. Rep. ISSTECH-96-002","author":"C. Ashcraft","year":"1996","unstructured":"C. Ashcraft, J.W.H. Liu, Robust ordering of sparse matrices using multisection, Techn. Rep. ISSTECH-96-002, Boeing Computer Services, Seattle, 1996."},{"key":"22_CR7","volume-title":"Techn. Rep.","author":"C. Ashcraft","year":"1996","unstructured":"C. Ashcraft, J.W.H. Liu, applications of the Dulmage-Mendelsohn decomposition and network flow of graph bisection improvement, Techn. Rep., Boeing Computer Services, Seattle, 1996."},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"S.T. Barnard, H.D. Simon, A fast multilevel implementation of recursive spectral bisection, Proc. of 6th SIAM Conf. Parallel Processing for Scientific Computing, 711\u2013718, 1993.","DOI":"10.1002\/cpe.4330060203"},{"issue":"No.1","key":"22_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1137\/0611005","volume":"11","author":"P. Berman","year":"1990","unstructured":"P. Berman, G. Schnitger, On the performance of the minimum degree ordering for Gaussian elimination, SIAM J. Matrix Anal. Appl., Vol. 11, No. 1, 83\u201388, 1990.","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"No.12","key":"22_CR10","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/43.103500","volume":"10","author":"C.-K. Cheng","year":"1991","unstructured":"C.-K. Cheng, Y.-C. Weil, An improved two-way partitioning algorithm with stable performance, IEEE Transactions on Computer Aided Design, Vol. 10, No. 12, 1502\u20131511, 1991.","journal-title":"IEEE Transactions on Computer Aided Design"},{"key":"22_CR11","unstructured":"R. Diekmann, B. Monien, R. Preis, Using helpful sets to improve graph bisections, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Volume 21, 1995."},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1145\/356044.356047","volume":"9","author":"I.S. Duff","year":"1983","unstructured":"I.S. Duff, J.K. Reid, The multifrontal solution of indefinite sparse symmetric linear equations, ACM Trans. Math. Software, Vol. 9, 302\u2013325, 1983.","journal-title":"ACM Trans. Math. Software"},{"key":"22_CR13","doi-asserted-by":"crossref","first-page":"517","DOI":"10.4153\/CJM-1958-052-0","volume":"10","author":"A. Dulmage","year":"1958","unstructured":"A. Dulmage, N. Mendelsohn, Coverings of bipartite graphs, Can. J. Math., Vol. 10, 517\u2013534, 1958.","journal-title":"Can. J. Math."},{"issue":"No.2","key":"22_CR14","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0902019","volume":"2","author":"S.C. Eisenstat","year":"1981","unstructured":"S.C. Eisenstat, M.H. Schultz, A.H. Sherman, Algorithms and data structures for sparse symmetric Gaussian elimination, SIAM J. Sci. Stat. Comput., Vol. 2, No. 2, 225\u2013237, 1981.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia, R.M. Mattheyses, A linear-time heuristic for improving network partitions, 19th IEEE Design Automation Conference, 175\u2013181, 1982.","DOI":"10.1109\/DAC.1982.1585498"},{"issue":"No.1","key":"22_CR16","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1137\/1032002","volume":"32","author":"K.A. Gallivan","year":"1990","unstructured":"K.A. Gallivan, R.J. Plemmons, A.H. Sameh, Parallel algorithms for dense linear algebra computations, SIAM Review Vol. 32, No. 1, 54\u2013135, 1990.","journal-title":"SIAM Review"},{"issue":"No.4","key":"22_CR17","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1137\/0909042","volume":"9","author":"G.A. Geist","year":"1988","unstructured":"G.A. Geist, C.H. Romine, LU factorization algorithms on distributed-memory multiprocessor architectures, SIAM J. Sci. Stat. Comput., Vol. 9, No. 4, 639\u2013649, 1988.","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"No.4","key":"22_CR18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01407861","volume":"18","author":"G.A. Geist","year":"1989","unstructured":"G.A. Geist, E. Ng, Task scheduling for parallel sparse Cholesky factorization, International Journal of Parallel Programming, Vol. 18, No. 4, 291\u2013314, 1989.","journal-title":"International Journal of Parallel Programming"},{"issue":"No.2","key":"22_CR19","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"A. George","year":"1973","unstructured":"A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., Vol. 10, No. 2, 345\u2013363, 1973.","journal-title":"SIAM J. Numer. Anal."},{"issue":"No.5","key":"22_CR20","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1137\/0715069","volume":"15","author":"A. George","year":"1978","unstructured":"A. George, J.W.H. Liu, An automatic nested dissection algorithm for irregular finite element problems, SIAM J. Numer. Anal., Vol. 15, No. 5, 1053\u20131069, 1978.","journal-title":"SIAM J. Numer. Anal."},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"A. George, M.T. Heath, E. Ng, J.W.H. Liu, Symbolic Cholesky factorization on a local-memory multiprocessor, Parallel Computing, 85\u201395, 1987.","DOI":"10.1016\/0167-8191(87)90009-3"},{"key":"22_CR22","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"J.A. George","year":"1981","unstructured":"J.A. George, J.W.H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981."},{"issue":"No.2","key":"22_CR23","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1137\/0717024","volume":"17","author":"A. George","year":"1980","unstructured":"A. George, J.W.H. Liu, A minimal storage implementation of the minimum degree algorithm, SIAM J. Numer. Anal, Vol. 17, No. 2, 282\u2013299, 1980.","journal-title":"SIAM J. Numer. Anal"},{"key":"22_CR24","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/355900.355906","volume":"6","author":"A. George","year":"1980","unstructured":"A. George, J.W.H. Liu, A fast implementation of the minimum degree algorithm using quotient graphs, ACM Trans. Math. Software, Vol. 6, 337\u2013358, 1980.","journal-title":"ACM Trans. Math. Software"},{"issue":"No.1","key":"22_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1031001","volume":"31","author":"A. George","year":"1989","unstructured":"A. George, J.W.H. Liu, The evolution of the minimum degree ordering algorithm, SIAM Review, Vol. 31, No. 1, 1\u201319, 1989.","journal-title":"SIAM Review"},{"key":"22_CR26","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0167-8191(89)90101-4","volume":"10","author":"A. George","year":"1989","unstructured":"A. George, J.W.H. Liu, E. Ng, Communication results for parallel sparse Cholesky factorization on a hypercube, Parallel Computing 10, 287\u2013298, 1989.","journal-title":"Parallel Computing"},{"issue":"No.2","key":"22_CR27","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, E. Ng, Sparse Cholesky factorization on a local-memory multiprocessor, SIAM J. Sci. Stat. Comput., Vol. 9, No. 2, 327\u2013340, 1988.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"22_CR28","volume-title":"Techn. Rep.","author":"M. Ghose","year":"1994","unstructured":"M. Ghose, E. Rothberg, A parallel implementation of the multiple minimum degree ordering heuristic, Techn. Rep., Old Dominion University, Norfolk, 1994."},{"key":"22_CR29","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1137\/0713023","volume":"13","author":"N.E. Gibbs","year":"1976","unstructured":"N.E. Gibbs, W.G. Poole, P.K. Stockmeyer, An algorithm for reducing the bandwidth and profile of a sparse matrix, SIAM J. Numer. Anal., Vol. 13, 236\u2013250, 1976.","journal-title":"SIAM J. Numer. Anal."},{"key":"22_CR30","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1137\/0613024","volume":"13","author":"J.R. Gilbert","year":"1992","unstructured":"J.R. Gilbert, C. Moler, R. Schreiber, Sparse matrices in MATLAB: design and implementation, SIAM J. Matrix Anal. Appl., Vol. 13, 333\u2013356, 1992.","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"No.5","key":"22_CR31","doi-asserted-by":"crossref","first-page":"1151","DOI":"10.1137\/0913067","volume":"13","author":"J.R. Gilbert","year":"1992","unstructured":"J.R. Gilbert, R. Schreiber, Highly sparse Cholesky factorization, SIAM J. Sci. Stat. Comput., Vol. 13, No. 5, 1151\u20131172, 1992.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"22_CR32","unstructured":"A. Gupta, Fast and effective algorithms for graph partitioning and sparse matrix ordering, IBM T.J. Watson Research Center, Research Report RC 20496, New York, 1996."},{"key":"22_CR33","unstructured":"A. Gupta, WGPP: Watson graph partitioning (and sparse matrix ordering) package, users manual, IBM T.J. Watson Research Center, Research Report RC 20453, New York, 1996."},{"key":"22_CR34","doi-asserted-by":"crossref","unstructured":"A. Gupta, V. Kumar, A Scalable parallel algorithm for sparse matrix factorization, Tech. Rep. 94-19, CS-Dep., Univ. Minnesota, 1994.","DOI":"10.1145\/602896.602898"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"L. Hagen, A. Kahng, A new approach in effective circuit clustering, Proc. of IEEE International Conference on Computer Aided Design, 422\u2013427, 1992.","DOI":"10.1109\/ICCAD.1992.279334"},{"issue":"No.3","key":"22_CR36","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/1033099","volume":"33","author":"M.T. Heath","year":"1991","unstructured":"M.T. Heath, E. Ng, B.W. Peyton, Parallel algorithms for sparse linear systems, SIAM Review, Vol. 33, No. 3, 420\u2013460, 1991.","journal-title":"SIAM Review"},{"key":"22_CR37","unstructured":"B. Hendrickson, R. Leland, The chaco user's guide, Tech. Rep. SAND94-2692, Sandia Nat. Lab., 1994."},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, R. Leland, An improved spectral graph partitioning algorithm for mapping parallel computations, SIAM J. Sci. Comput., Vol. 16, 1995.","DOI":"10.1137\/0916028"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"B. Hendrickson, R. Leland, A multilevel algorithm for partitioning graphs, Proc. of Supercomputing'95, 1995.","DOI":"10.1145\/224170.224228"},{"key":"22_CR40","unstructured":"B. Hendrickson, E. Rothberg, Improving the runtime and quality of nested dissection ordering, Techn. Rep., SAND96-0868, Sandia Nat. Lab., 1996."},{"key":"22_CR41","unstructured":"B. Hendrickson, E. Rothberg, Effective sparse matrix ordering: just around the BEND, Proc. of 8th SIAM Conf. Parallel Processing for Scientific Computing, 1997."},{"issue":"No.5","key":"22_CR42","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1137\/0912063","volume":"12","author":"L. Hulbert","year":"1991","unstructured":"L. Hulbert, E. Zmijewski, Limiting communication in parallel sparse Cholesky factorization, SIAM J. Sci. Stat. Comput., Vol. 12, No. 5, 1184\u20131197, 1991.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"22_CR43","unstructured":"G. Karypis, V. Kumar, A high performance sparse Cholesky factorization algorithm for scalable parallel computers, Tech. Rep. 94-41, CS-Dep., Univ. Minnesota, 1994."},{"key":"22_CR44","unstructured":"G. Karypis, V. Kumar, A fast and high quality multilevel scheme for partitioning irregular graphs, Tech. Rep. 95-035, CS-Dep., Univ. Minnesota, 1995."},{"key":"22_CR45","unstructured":"G. Karypis, V. Kumar, METIS: unstructured graph partitioning and sparse matrix ordering system, Techn. Rep., CS-Dep., Univ. Minnesota, 1995."},{"key":"22_CR46","doi-asserted-by":"crossref","unstructured":"B.W. Kernighan, S. Lin, An effective heuristic procedure for partitioning graphs, The Bell Systems Technical Journal, 291\u2013308, 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"22_CR47","volume-title":"Introduction to Parallel Computing: Design and Analysis of Algorithms","author":"V. Kumar","year":"1994","unstructured":"V. Kumar, A. Grama, A. Gupta, G. Karypis, Introduction to Parallel Computing: Design and Analysis of Algorithms, Benjamin Cummings Publishing Company, Redwood City, CA, 1994."},{"key":"22_CR48","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D. K\u00f6nig","year":"1916","unstructured":"D. K\u00f6nig, \u00dcber Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Math. Ann., 77, 453\u2013465, 1916.","journal-title":"Math. Ann."},{"key":"22_CR49","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-8191(89)90016-1","volume":"10","author":"M. Leuze","year":"1989","unstructured":"M. Leuze, Independent set orderings for parallel matrix factorization by Gaussian elimination, Parallel Computing, Vol. 10, 177\u2013191, 1989.","journal-title":"Parallel Computing"},{"issue":"No.6","key":"22_CR50","doi-asserted-by":"crossref","first-page":"1146","DOI":"10.1137\/0910070","volume":"10","author":"J.G. Lewis","year":"1989","unstructured":"J.G. Lewis, B.W. Peyton, A. Pothen, A fast algorithm for reordering sparse matrices for parallel factorization, SIAM J. Sci. Stat. Comput., Vol. 10, No. 6, 1146\u20131173, 1989.","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"No.2","key":"22_CR51","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","volume":"11","author":"J.W.H. Liu","year":"1985","unstructured":"J.W.H. Liu, Modification of the minimum-degree algorithm by multiple elimination, ACM Trans. Math. Software, Vol. 11, No. 2, 141\u2013153, 1985.","journal-title":"ACM Trans. Math. Software"},{"issue":"No.3","key":"22_CR52","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/0909029","volume":"9","author":"J.W.H. Liu","year":"1988","unstructured":"J.W.H. Liu, Equivalent sparse matrix reordering by elimination tree rotations, SIAM J. Sci. Stat. Comput., Vol. 9, No. 3, 424\u2013444, 1988.","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"No.3","key":"22_CR53","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1145\/66888.66890","volume":"15","author":"J.W.H. Liu","year":"1989","unstructured":"J.W.H. Liu, A graph partitioning algorithm by node separators, ACM Trans. Math. Software, Vol. 15, No. 3, 198\u2013219, 1989.","journal-title":"ACM Trans. Math. Software"},{"key":"22_CR54","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-8191(89)90064-1","volume":"11","author":"J.W.H. Liu","year":"1989","unstructured":"J.W.H. Liu, Reordering sparse matrices for parallel elimination, Parallel Computing 11, 73\u201391, 1989.","journal-title":"Parallel Computing"},{"issue":"No.6","key":"22_CR55","doi-asserted-by":"crossref","first-page":"1136","DOI":"10.1137\/0910069","volume":"10","author":"J.W.H. Liu","year":"1989","unstructured":"J.W.H. Liu, The minimum degree ordering with constraints, SIAM J. Sci. Stat. Comput., Vol. 10, No. 6, 1136\u20131145, 1989.","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"No.1","key":"22_CR56","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"J.W.H. Liu, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., Vol. 11, No. 1, 134\u2013172, 1990.","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"No.1","key":"22_CR57","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1137\/1034004","volume":"34","author":"J.W.H. Liu","year":"1992","unstructured":"J.W.H. Liu, The multifrontal method for sparse matrix solutions: theory and practice, SIAM Review, Vol. 34, No. 1, 82\u2013109, 1992.","journal-title":"SIAM Review"},{"issue":"No.1","key":"22_CR58","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0402011","volume":"2","author":"J.W.H. Liu","year":"1989","unstructured":"J.W.H. Liu, A. Mirzaian, A linear reordering algorithm for parallel pivoting of chordal graphs, SIAM J. Disc. Math., Vol. 2, No. 1, 100\u2013107, 1989.","journal-title":"SIAM J. Disc. Math."},{"issue":"No.6","key":"22_CR59","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1109\/TCAD.1987.1270339","volume":"6","author":"R.F. Lucas","year":"1987","unstructured":"R.F. Lucas, T. Blank, J.J. Tiemann, A parallel solution method for large sparse systems of equations, IEEE Transactions on Computer Aided Design, Vol. 6, No. 6, 981\u2013991, 1987.","journal-title":"IEEE Transactions on Computer Aided Design"},{"issue":"No.3","key":"22_CR60","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0913049","volume":"13","author":"M. Mu","year":"1992","unstructured":"M. Mu, J.R. Rice, A grid-based subtree-subcube assignment strategy for solving partial differential equations on hypercubes, SIAM J. Sci. Stat. Comput., Vol. 13, No. 3, 826\u2013839, 1992.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"22_CR61","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1137\/1003021","volume":"3","author":"S.V. Parter","year":"1961","unstructured":"S.V. Parter, The use of linear graphs in Gauss elimination, SIAM Review, Vol. 3, 119\u2013130, 1961.","journal-title":"SIAM Review"},{"key":"22_CR62","unstructured":"R. Pozo, S.L. Smith, Performance evaluation of the parallel multifrontal method in a distributed-memory environment, Proc. of 6th SIAM Conference on Parallel Processing for Scientific Computing, 1993."},{"issue":"No.4","key":"22_CR63","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/98267.98287","volume":"16","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, C.-J. Fan, Computing the block triangular form of a sparse matrix, ACM Trans. Math. Software, Vol. 16, No. 4, 303\u2013324, 1990.","journal-title":"ACM Trans. Math. Software"},{"issue":"No.3","key":"22_CR64","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H.D. Simon, K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl., Vol. 11, No. 3, 430\u2013452, 1990.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"22_CR65","unstructured":"A. Pothen, C. Sun, Distributed multifrontal factorization using clique trees, Proc. 5th SIAM Conference on Parallel Processing for Scientific Computing, 34\u201340, 1991."},{"issue":"No.5","key":"22_CR66","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0914074","volume":"14","author":"A. Pothen","year":"1993","unstructured":"A. Pothen, C. Sun, A mapping algorithm for parallel sparse Cholesky factorization, SIAM J. Sci. Comput., Vol. 14, No. 5, 1253\u20131257, 1993.","journal-title":"SIAM J. Sci. Comput."},{"key":"22_CR67","unstructured":"R. Preis, R. Diekmann, The PARTY partitioning library user guide \u2014 version 1.1, Techn. Rep., CS-Dept., Univ. of Paderborn, 1996."},{"key":"22_CR68","doi-asserted-by":"crossref","unstructured":"E. Rothberg, A. Gupta, An efficient block-oriented approach to parallel sparse Cholesky factorization, Proc. of Supercomputmg'92. 1992.","DOI":"10.1145\/169627.169791"},{"key":"22_CR69","volume-title":"Graph-Teory and Computing","author":"D. J. Rose","year":"1972","unstructured":"D. J. Rose, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in Graph-Teory and Computing, R. Read (Ed.), Academic Press, New York, 1972."},{"issue":"No.2","key":"22_CR70","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. J. Rose","year":"1976","unstructured":"D. J. Rose, R.E. Tarjan, G.S. Luecker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., Vol. 5, No. 2, 266\u2013283, 1976.","journal-title":"SIAM J. Comput."},{"key":"22_CR71","doi-asserted-by":"crossref","unstructured":"R. Schreiber, Scalability of sparse direct solvers, in Sparse Matrix Computations: Graph Theory Issues and Algorithms, J.R. Gilbert, J.W.H. Liu (Eds.), Springer Verlag, 1992.","DOI":"10.1007\/978-1-4613-8369-7_9"},{"key":"22_CR72","unstructured":"J. Schulze, A new multilevel scheme for constructing vertex separators, Techn. Rep., CS-Dept., Univ. of Paderborn, 1997."},{"key":"22_CR73","unstructured":"J. Schulze, Implementation of a parallel algorithm for sparse matrix factorization, Techn. Rep., CS-Dept., Univ. of Paderborn, 1996."},{"issue":"No.1","key":"22_CR74","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","volume":"2","author":"M. Yannakakis","year":"1981","unstructured":"M. Yannakakis, Computing the minimum fill-in is NP-complete, SIAM J. Alg. Disc. Meth., Vol. 2, No. 1, 77\u201379, 1981.","journal-title":"SIAM J. Alg. Disc. Meth."}],"container-title":["Lecture Notes in Computer Science","Solving Irregularly Structured Problems in Parallel"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63138-0_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:35:42Z","timestamp":1640950542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63138-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631385","9783540691570"],"references-count":74,"URL":"https:\/\/doi.org\/10.1007\/3-540-63138-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}