{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T16:09:22Z","timestamp":1787501362328,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540614227","type":"print"},{"value":"9783540685296","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61422-2_130","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:36:47Z","timestamp":1330274207000},"page":"173-184","source":"Crossref","is-referenced-by-count":4,"title":["Making an arbitrary filled graph minimal by removing fill edges"],"prefix":"10.1007","author":[{"given":"Jean R. S.","family":"Blair","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pinar","family":"Heggernes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jan Arne","family":"Telle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"A.Agrawal, P.Klein, and R.Ravi. Cutting down on fill using nested dissection: provably good elimination orderings. In J. A. George, J. R. Gilbert, and J. W. H. Liu, editors, Sparse matrix computations: Graph theory issues and algorithms, pages 31\u201355. Springer Verlag, 1993. IMA Volumes in Mathematics and its Applications, Vol. 56.","DOI":"10.1007\/978-1-4613-8369-7_2"},{"key":"16_CR2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","volume":"30","author":"C. Beeri","year":"1983","unstructured":"C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database systems. J. Assoc. Comput. Mach., 30:479\u2013513, 1983.","journal-title":"J. Assoc. Comput. Mach."},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jctb.1994.1056","volume":"31","author":"F. R. K. Chung","year":"1994","unstructured":"F. R. K. Chung and D. Mumford. Chordal completions of planar graphs. J. Comb. Theory, 31:96\u2013106, 1994.","journal-title":"J. Comb. Theory"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"E. Dahlhaus and M. Karpinski. An efficient parallel algorithm for the minimal elimination ordering of an arbitrary graph. Proceedings FOCS, pages 454\u2013459, 1989.","DOI":"10.1109\/SFCS.1989.63518"},{"key":"16_CR5","series-title":"Technical Report","volume-title":"Independent computations in a probablistic knowledge-based system","author":"R. E. England","year":"1991","unstructured":"R. E. England, J. R. S. Blair, and M. G. Thomason. Independent computations in a probablistic knowledge-based system. Technical Report CS-90-128, Department of Computer Science, The University of Tennessee, Knoxville, Tennessee, 1991."},{"key":"16_CR6","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A. George","year":"1981","unstructured":"A. George and J.W-H. Liu. Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall Inc., Englewood Cliffs, New Jersey, 1981."},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1111\/j.2517-6161.1988.tb01721.x","volume":"50","author":"S. L. Lauritzen","year":"1988","unstructured":"S. L. Lauritzen and D. J. Spiegelhalter. Local computations with probabilities on graphical structures and their applications to expert systems. J. Royal Statist. Soc., ser B, 50:157\u2013224, 1988.","journal-title":"J. Royal Statist. Soc., ser B"},{"key":"16_CR8","doi-asserted-by":"crossref","first-page":"1156","DOI":"10.1137\/0910070","volume":"10","author":"J. G. Lewis","year":"1989","unstructured":"J. G. Lewis, B. W. Peyton, and A. Pothen. A fast algorithm for reordering sparse matrices for parallel factorization. SIAM J. Sci. Stat. Comput., 10:1156\u20131173, 1989.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"16_CR9","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1137\/0402011","volume":"2","author":"J. W. Liu","year":"1989","unstructured":"J. W-H. Liu and A. Mirzaian. A linear reordering algorithm for parallel pivoting of chordal graphs. SIAM J. Disc. Math., 2:100\u2013107, 1989.","journal-title":"SIAM J. Disc. Math."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1016\/0022-247X(76)90182-7","volume":"54","author":"T. Ohtsuki","year":"1976","unstructured":"T. Ohtsuki, L.K. Cheung, and T. Fujisawa. Minimal triangulation of a graph and optimal pivoting ordering in a sparse matrix. J. Math. Anal. Appl., 54:622\u2013633, 1976.","journal-title":"J. Math. Anal. Appl."},{"key":"16_CR11","unstructured":"B. W. Peyton. Some applications of clique trees to the solution of sparse linear systems. PhD thesis, Dept. of Mathematical Sciences, Clemson University, 1986."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"D. J. Rose. A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations. In R. C. Read, editor, Graph Theory and Computing, pages 183\u2013217. Academic Press, 1972.","DOI":"10.1016\/B978-1-4832-3187-7.50018-0"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"D.J. Rose, R.E. Tarjan, and G.S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput., 5:266\u2013283, 1976.","journal-title":"SIAM J. Comput."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. E. Tarjan","year":"1984","unstructured":"R. E. Tarjan and M. Yannakakis. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput., 13:566\u2013579, 1984.","journal-title":"SIAM J. Comput."},{"key":"16_CR15","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., 2:77\u201379, 1981.","journal-title":"SIAM J. Alg. Disc. Meth."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2014 SWAT'96"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61422-2_130.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T13:27:34Z","timestamp":1713619654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61422-2_130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540614227","9783540685296"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-61422-2_130","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}