{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:12:57Z","timestamp":1725455577273},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024494","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"132-143","source":"Crossref","is-referenced-by-count":13,"title":["Minimal elimination ordering inside a given chordal graph"],"prefix":"10.1007","author":[{"given":"Dias","family":"Dahlhaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"A. Agrawal, P. Klein, R. Ravi, Cutting Down on Fill-in Using Nested Dissection, in Sparse Matrix Computations: Graph Theory Issues and Algorithms, A. George, J. Gilbert, J.W.-H. Liu ed., IMA Volumes in Mathematics and its Applications, Vol. 56, Springer Verlag, 1993, pp. 31\u201355.","DOI":"10.1007\/978-1-4613-8369-7_2"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"J. Blair, P. Heggernes, J.A. Telle, Making an Arbitrary Filled Graph Minimal by Removing Fill Edges, Algorithm Theory.-SWAT96, R. Karlsson, A. Lingas ed., LLNCS 1097, pp. 173\u2013184.","DOI":"10.1007\/3-540-61422-2_130"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Bunemann","year":"1974","unstructured":"P. Bunemann, A Characterization of Rigid Circuit Graphs, Discrete Mathematics 9 (1974), pp. 205\u2013212.","journal-title":"Discrete Mathematics"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"E. Dahlhaus, Fast parallel algorithm for the single link heuristics of hierarchical clustering, Proceedings of the fourth IEEE Symposium on Parallel and Distributed Processing (1992), pp. 184\u2013186.","DOI":"10.1109\/SPDP.1992.242746"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"E. Dahlhaus, Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representation, Proceedings of the 27-th Annual Hawaii International Conference on System Sciences, Vol. II (1994), pp. 150\u2013158.","DOI":"10.1109\/HICSS.1994.323270"},{"key":"13_CR6","unstructured":"Elias Dahlhaus, Sequential and Parallel Algorithms on Compactly Represented Chordal and Strongly Chordal Graphs, STAGS 97, R. Reischuk, M. Morvan ed., LLNCS 1200 (1997), pp. 487\u2013498."},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/0304-3975(94)90250-X","volume":"134","author":"E. Dahlhaus","year":"1994","unstructured":"Elias Dahlhaus, Marek Karpinski, An Efficient Parallel Algorithm for the Minimal Elimination Ordering (MEO) of an Arbitrary Graph, Theoretical Computer Science 134 (1994), pp. 493\u2013528.","journal-title":"Theoretical Computer Science"},{"key":"13_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M. Farber","year":"1983","unstructured":"M. Farber, Characterizations of Strongly Chordal Graphs, Discrete Mathematics 43 (1983), pp. 173\u2013189.","journal-title":"Discrete Mathematics"},{"key":"13_CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F. Gavril","year":"1974","unstructured":"F. Gavril, The Intersection Graphs of Subtrees in Trees Are Exactly the Chordal Graphs, Journal of Combinatorial Theory Series B, vol. 16 (1974), pp. 47\u201356.","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"13_CR10","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A. George","year":"1981","unstructured":"A. George, J.W.-H. Liu, Computer Solution of Large Sparse Positive Definite Systems, Prentice Hall Inc., Englewood Cliffs, NJ, 1981."},{"key":"13_CR11","unstructured":"J. Gilbert, H. Hafsteinsson, Parallel Solution of Sparse Linear Systems, SWAT 88"},{"key":"13_CR12","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D. Rose","year":"1970","unstructured":"D. Rose, Triangulated Graphs and the Elimination Process, Journal of Mathematical Analysis and Applications 32 (1970), pp. 597\u2013609.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D. Rose","year":"1976","unstructured":"D. Rose, R. Tarjan, G. Lueker, Algorithmic Aspects on Vertex Elimination on Graphs, SIAM Journal on Computing 5 (1976), pp. 266\u2013283.","journal-title":"SIAM Journal on Computing"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","volume":"3","author":"Y. Shiloach","year":"1982","unstructured":"Y. Shiloach, U. Vishkin, An O(log n) Parallel Connectivity Algorithm, Journal of Algorithms 3 (1982), pp. 57\u201367.","journal-title":"Journal of Algorithms"},{"key":"13_CR15","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"R. Tarjan","year":"(1975","unstructured":"R. Tarjan, Efficiency of a Good but not Linear Set Union Algorithm, Journal of the ACM 22 (1975), pp. 215\u2013225.","journal-title":"Journal of the ACM"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. Tarjan","year":"1984","unstructured":"R. Tarjan, M. Yannakakis, Simple Linear Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs, SIAM Journal on Computing 13 (1984), pp. 566\u2013579.","journal-title":"SIAM Journal on Computing"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Addendum: SIAM Journal on Computing 14 (1985), pp. 254\u2013255.","DOI":"10.1137\/0214020"},{"key":"13_CR18","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 Journal on Algebraic and Discrete Methods 2 (1981), pp. 77\u201379.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024494","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:35:22Z","timestamp":1586568922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024494"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0024494","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}