{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:41Z","timestamp":1725663341618},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540189916"},{"type":"electronic","value":"9783540388883"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-18991-2_29","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T14:51:37Z","timestamp":1330181497000},"page":"498-513","source":"Crossref","is-referenced-by-count":1,"title":["A parallel graph partitioning algorithm for a message-passing multiprocessor"],"prefix":"10.1007","author":[{"given":"John R.","family":"Gilbert","sequence":"first","affiliation":[]},{"given":"Earl","family":"Zmijewski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"29_CR1","unstructured":"Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, 1974."},{"key":"29_CR2","unstructured":"R. M. Chamberlain. An algorithm for LU factorization with partial pivoting on the hypercube. Technical Report CCS 86\/11, Chr. Michelsen Institute, 1986."},{"key":"29_CR3","unstructured":"R. M. Chamberlain and M. J. D. Powell. QR factorization for linear least squares problems on the hypercube. Technical Report CCS 86\/10, Chr. Michelsen Institute, 1986."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"T. H. Dunigan. A message-passing multiprocessor simulator. Technical Report ORNL\/TM-9966, Oak Ridge National Laboratory, 1986.","DOI":"10.2172\/5760616"},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1002\/nme.1620140606","volume":"14","author":"G. C. Everstine","year":"1979","unstructured":"G. C. Everstine. A comparison of three resequencing algorithms for the reduction of matrix profile and wave front. International Journal for Numerical Methods in Engineering, 14:837\u2013853, 1979.","journal-title":"International Journal for Numerical Methods in Engineering"},{"key":"29_CR6","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/C-M.1981.220290","volume":"12","author":"T. Feng","year":"1981","unstructured":"Tse-yun Feng. A survey of interconnection networks. IEEE Computer, 12:12\u201327, 1981.","journal-title":"IEEE Computer"},{"key":"29_CR7","unstructured":"Geoffrey C. Fox and Steve W. Otto. Concurrent computation and the theory of complex systems. Technical Report CALT-68-1343, California Institute of Technology, 1986."},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Alan George, Michael T. Heath, Joseph Liu, and Esmond Ng. Sparse Cholesky factorization on a local-memory multiprocessor. Technical Report ORNL\/TM-9962, Oak Ridge National Laboratory, 1986.","DOI":"10.2172\/5868908"},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1137\/0715069","volume":"15","author":"A. George","year":"1978","unstructured":"Alan George and Joseph W. H. Liu. An automatic nested dissection algorithm for irregular finite element problems. SIAM Journal on Numerical Analysis, 15:1053\u20131069, 1978.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"29_CR10","unstructured":"Alan George and Joseph W. H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, 1981."},{"key":"29_CR11","unstructured":"Alan George, Joseph W. H. Liu, and Esmond Ng. Communication results for parallel sparse Cholesky factorization on a hypercube. Submitted to Parallel Computing, 1987."},{"key":"29_CR12","unstructured":"John R. Gilbert and Robert Endre Tarjan. The analysis of a nested dissection algorithm. To appear in Numerische Mathematik, 1987."},{"key":"29_CR13","unstructured":"John Russell Gilbert. Graph Separator Theorems and Sparse Gaussian Elimination. Ph.D. thesis, Stanford University, 1980."},{"key":"29_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B. W. Kernighan","year":"1970","unstructured":"B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal, 49:291\u2013307, 1970.","journal-title":"The Bell System Technical Journal"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Charles E. Leiserson. Area-efficient graph layouts (for VLSI). In Proceedings of the 21st Annual Symposium on Foundations of Computer Science, pages 270\u2013281, 1980.","DOI":"10.1109\/SFCS.1980.13"},{"key":"29_CR16","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"Richard J. J. Lipton","year":"1979","unstructured":"Richard J. Lipton, Donald J. Rose, and Robert Endre Tarjan. Generalized nested dissection. SIAM Journal on Numerical Analysis, 16:346\u2013358, 1979.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"29_CR17","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"Richard J. J. Lipton","year":"1980","unstructured":"Richard J. Lipton and Robert Endre Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 9:615\u2013627, 1980.","journal-title":"SIAM Journal on Computing"},{"key":"29_CR18","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0167-8191(86)90014-1","volume":"3","author":"Joseph W. W. H. H. Liu","year":"1986","unstructured":"Joseph W. H. Liu. Computational models and task scheduling for parallel sparse Cholesky factorization. Parallel Computing, 3:327\u2013342, 1986.","journal-title":"Parallel Computing"},{"key":"29_CR19","unstructured":"Joseph W. H. Liu. Equivalent sparse matrix reordering by elimination tree rotations. Technical Report CS-86-12, York University, 1986."},{"key":"29_CR20","unstructured":"Joseph W. H. Liu. The solution of mesh equations on a parallel computer. Technical Report, University of Waterloo, 1974."},{"key":"29_CR21","unstructured":"Frans J. Peters. MIMD machines and sparse linear equations. In Highly parallel computers for numerical and signal processing applications: Proceedings of a working conference of the International Federation for Information Processing Working Group 10.3, North-Holland, 1986."},{"key":"29_CR22","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0167-8191(84)90446-0","volume":"1","author":"Frans J. J. Peters","year":"1984","unstructured":"Frans J. Peters. Parallel pivoting algorithms for sparse symmetric matrices. Parallel Computing, 1:99\u2013110, 1984.","journal-title":"Parallel Computing"},{"key":"29_CR23","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"Donald J. J. Rose","year":"1976","unstructured":"Donald J. Rose, Robert Endre Tarjan, and George S. Leuker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal on Computing, 5:266\u2013283, 1976.","journal-title":"SIAM Journal on Computing"},{"key":"29_CR24","unstructured":"Earl Zmijewski. Sparse Cholesky Factorization on a Multiprocessor. Ph.D. thesis, Cornell University, 1987."},{"key":"29_CR25","unstructured":"Earl Zmijewski and John R. Gilbert. A parallel algorithm for large sparse symbolic and numeric Cholesky factorization on a multiprocessor. Technical Report 86\u2013733, Cornell University, 1986."},{"key":"29_CR26","unstructured":"Earl Zmijewski and John R. Gilbert. A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor. To appear in Parallel Computing."}],"container-title":["Lecture Notes in Computer Science","Supercomputing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-18991-2_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:15:50Z","timestamp":1605626150000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-18991-2_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540189916","9783540388883"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-18991-2_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}