{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T09:16:39Z","timestamp":1768641399212,"version":"3.49.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[1989,7]]},"DOI":"10.1016\/0167-8191(89)90064-1","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"73-91","source":"Crossref","is-referenced-by-count":51,"title":["Reordering sparse matrices for parallel elimination"],"prefix":"10.1016","volume":"11","author":[{"given":"Joseph W.H","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(89)90064-1_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0167-8191(89)90064-1_BIB2","series-title":"ICASE Report No. 85-48","article-title":"Multiprocessor sparse L\/U decomposition with controlled fill-in","author":"Alaghband","year":"1985"},{"key":"10.1016\/0167-8191(89)90064-1_BIB3","series-title":"Technical Report","article-title":"Optimal ordering of sparse matrices for parallel trianulation","author":"Betancourt","year":"1985"},{"key":"10.1016\/0167-8191(89)90064-1_BIB4","series-title":"Proc. 11th Annual Allerton Conference Circuit and System Theory","first-page":"729","article-title":"Parallel solution of sparse simultaneous linear equations","author":"Calahan","year":"1973"},{"key":"10.1016\/0167-8191(89)90064-1_BIB5","series-title":"Computer and Job Shop Scheduling Theory","author":"Coffman","year":"1976"},{"key":"10.1016\/0167-8191(89)90064-1_BIB6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0167-8191(86)90019-0","article-title":"Parallel implementation of multifrontal schemes","volume":"3","author":"Duff","year":"1986","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(89)90064-1_BIB7","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/1057588.1057590","article-title":"Sparse matrix test problems","volume":"17","author":"Duff","year":"1982","journal-title":"SIGNUM Newslett."},{"key":"10.1016\/0167-8191(89)90064-1_BIB8","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1137\/0909021","article-title":"Sparse Cholesky factorization on a local-memory multiprocessor","volume":"9","author":"George","year":"1988","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0167-8191(89)90064-1_BIB9","series-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/0167-8191(89)90064-1_BIB10","series-title":"Hypercube Multiprocessors 1987","article-title":"Communication reduction in parallel sparse Cholesky factorization on a hypercube","author":"George","year":"1987"},{"key":"10.1016\/0167-8191(89)90064-1_BIB11","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0167-8191(89)90064-1_BIB12","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1109\/TCS.1979.1084692","article-title":"Optimal parallel triangulation of a sparse matrix","volume":"26","author":"Huang","year":"1976","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0167-8191(89)90064-1_BIB13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1109\/TC.1982.1675979","article-title":"A data structure for parallel L\/U decomposition","volume":"31","author":"Jess","year":"1982","journal-title":"IEEE Trans. Comout."},{"key":"10.1016\/0167-8191(89)90064-1_BIB14","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","article-title":"Modification of the minimum degree algorithm by multiple elimination","volume":"11","author":"Liu","year":"1985","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(89)90064-1_BIB15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0167-8191(86)90014-1","article-title":"Computational models and task scheduling for parallel sparse Cholesky factorization","volume":"3","author":"Liu","year":"1986","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(89)90064-1_BIB16","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1137\/0909029","article-title":"Equivalent sparse matrix reordering by elimination tree rotations","volume":"9","author":"Liu","year":"1988","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/0167-8191(89)90064-1_BIB17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/6497.6499","article-title":"A compact row storage scheme for Cholesky factors using elimination trees","volume":"12","author":"Liu","year":"1986","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(89)90064-1_BIB18","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0402011","article-title":"A linear reordering algorithm for parallel pivoting of chordal graphs","volume":"2","author":"Liu","year":"1989","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0167-8191(89)90064-1_BIB19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0167-8191(84)90446-0","article-title":"Parallel pivoting algorithms for sparse symmetric matrices","volume":"1","author":"Peters","year":"1984","journal-title":"Parallel Comput."},{"key":"10.1016\/0167-8191(89)90064-1_BIB20","series-title":"Graph Theory and Computing","first-page":"183","article-title":"A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations","author":"Rose","year":"1972"},{"key":"10.1016\/0167-8191(89)90064-1_BIB21","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-8191(89)90064-1_BIB22","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/356004.356006","article-title":"A new implementation of sparse Gaussian elimination","volume":"8","author":"Schreiber","year":"1982","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0167-8191(89)90064-1_BIB23","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","article-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900641?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819189900641?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:24:58Z","timestamp":1551086698000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819189900641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["0167819189900641"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(89)90064-1","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1989,7]]}}}