{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:44:09Z","timestamp":1774946649964,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4580,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,1]]},"DOI":"10.1016\/s0304-3975(99)00126-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:32:23Z","timestamp":1027607543000},"page":"125-141","source":"Crossref","is-referenced-by-count":43,"title":["A practical algorithm for making filled graphs minimal"],"prefix":"10.1016","volume":"250","author":[{"given":"Jean R.S.","family":"Blair","sequence":"first","affiliation":[]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(99)00126-7_BIB1","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database systems","volume":"30","author":"Beeri","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(99)00126-7_BIB2","first-page":"173","article-title":"Making an arbitrary filled graph minimal by removing fill edges","volume":"vol. 1097","author":"Blair","year":"1996"},{"key":"10.1016\/S0304-3975(99)00126-7_BIB3","series-title":"The Quality of Numerical Software","first-page":"125","article-title":"Matrix market","author":"Boisvert","year":"1997"},{"key":"10.1016\/S0304-3975(99)00126-7_BIB4","unstructured":"R. Boisvert, R. Pozo, K. Remington, B. Miller, R. Lipman, NIST Matrix Market, http.\/\/math.nist.gov\/MatrixMarket\/."},{"key":"10.1016\/S0304-3975(99)00126-7_BIB5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jctb.1994.1056","article-title":"Chordal completions of planar graphs","volume":"31","author":"Chung","year":"1994","journal-title":"J. Combin. Theory"},{"key":"10.1016\/S0304-3975(99)00126-7_BIB6","first-page":"132","article-title":"Minimal elimination ordering inside a given chordal graph","volume":"vol. 1335","author":"Dahlhaus","year":"1997"},{"key":"10.1016\/S0304-3975(99)00126-7_BIB7","doi-asserted-by":"crossref","unstructured":"E. Dahlhaus, M. Karpinski, An efficient parallel algorithm for the minimal elimination ordering of an arbitrary graph, Proc. FOCS, 1989, pp. 454\u2013459.","DOI":"10.1109\/SFCS.1989.63518"},{"key":"10.1016\/S0304-3975(99)00126-7_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/62038.62043","article-title":"Sparse matrix test problems","volume":"15","author":"Duff","year":"1989","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0304-3975(99)00126-7_BIB9","unstructured":"R.E. England, J.R.S. Blair, M.G. Thomason, Independent computations in a probablistic knowledge-based system, Technical Report CS-90-128, Department of Computer Science, University of Tennessee, Knoxville, Tennessee, 1991."},{"key":"10.1016\/S0304-3975(99)00126-7_BIB10","series-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/S0304-3975(99)00126-7_BIB11","unstructured":"G. Karypis, METIS Family of multilevel partitioning algorithms, http.\/\/www-users.cs.umn.edu\/\u00a0\u0303karypis\/metis\/."},{"key":"10.1016\/S0304-3975(99)00126-7_BIB12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","article-title":"Local computations with probabilities on graphical structures and their applications to expert systems","volume":"50","author":"Lauritzen","year":"1988","journal-title":"J. Royal Statist. Soc. Ser B"},{"key":"10.1016\/S0304-3975(99)00126-7_BIB13","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1137\/0910070","article-title":"A fast algorithm for reordering sparse matrices for parallel factorization","volume":"10","author":"Lewis","year":"1989","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"10.1016\/S0304-3975(99)00126-7_BIB14","unstructured":"J.W.H. Liu, Private communication."},{"key":"10.1016\/S0304-3975(99)00126-7_BIB15","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\/S0304-3975(99)00126-7_BIB16","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\/S0304-3975(99)00126-7_BIB17","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/0022-247X(76)90182-7","article-title":"Minimal triangulation of a graph and optimal pivoting ordering in a sparse matrix","volume":"54","author":"Ohtsuki","year":"1976","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0304-3975(99)00126-7_BIB18","unstructured":"B.W. Peyton, Some applications of clique trees to the solution of sparse linear systems, Ph.D. Thesis, Department of Mathematical Sciences, Clemson University, 1986."},{"key":"10.1016\/S0304-3975(99)00126-7_BIB19","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\/S0304-3975(99)00126-7_BIB20","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\/S0304-3975(99)00126-7_BIB21","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(99)00126-7_BIB22","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/0602010","article-title":"Computing the minimum fill-in is NP-complete","volume":"2","author":"Yannakakis","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397599001267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,4]],"date-time":"2024-12-04T03:02:18Z","timestamp":1733281338000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397599001267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,1]]},"references-count":22,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,1]]}},"alternative-id":["S0304397599001267"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(99)00126-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,1]]}}}