{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:36:52Z","timestamp":1743129412121,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540646822"},{"type":"electronic","value":"9783540691068"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054369","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T07:43:28Z","timestamp":1149666208000},"page":"210-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Minimal elimination of planar graphs"],"prefix":"10.1007","author":[{"given":"Elias","family":"Dahlhaus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"20_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":"20_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-SWAT '96, R. Karlsson, A. Lingas ed., LLNCS 1097, pp. 173\u2013184.","DOI":"10.1007\/3-540-61422-2_130"},{"key":"20_CR3","doi-asserted-by":"publisher","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":"20_CR4","doi-asserted-by":"crossref","unstructured":"E. Dahlhaus, Minimal Elimination Ordering inside a Given Chordal Graph, WG 97 (R. M\u00f6hring ed.), LLNCS 1335, pp. 132\u2013143.","DOI":"10.1007\/BFb0024494"},{"key":"20_CR5","doi-asserted-by":"publisher","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":"20_CR6","unstructured":"M. Eiermann, O. Ernst, W. Queck, Finite Element Tutorial, TU-Bergakademie Freiberg."},{"key":"20_CR7","doi-asserted-by":"publisher","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":"20_CR8","doi-asserted-by":"publisher","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":"20_CR9","first-page":"427","volume":"50","author":"J. Gilbert","year":"1987","unstructured":"J. Gilbert, R. Tarjan, The Analysis of a Nested Dissection Algorithm, Numerische Mathematik 50 (1987), pp. 427\u2013449.","journal-title":"Numerische Mathematik"},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. Lipton","year":"1979","unstructured":"R. Lipton, R. Tarjan, A Separator Theorem for Planar Graphs, SIAM Journal on Applied Mathematics 36 (1979) pp. 177\u2013189.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"20_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/3-540-60084-1_68","volume":"944","author":"A. Parra","year":"1995","unstructured":"Parra, A., Scheffler, P., How to use minimal separators for its chordal triangulation, Proceedings of the 20\n                        \n                  th\n                \n                        International Symposium on Automata, Languages and Programming (ICALP'95), Springer-Verlag Lecture Notes in Computer Science 944, (1995), pp. 123\u2013134.","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"20_CR12","doi-asserted-by":"publisher","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":"20_CR13","doi-asserted-by":"publisher","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":"20_CR14","doi-asserted-by":"publisher","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. Addendum: SIAM Journal on Computing 14 (1985), pp. 254\u2013255.","journal-title":"SIAM Journal on Computing"},{"key":"20_CR15","doi-asserted-by":"publisher","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","Algorithm Theory \u2014 SWAT'98"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054369","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T23:24:13Z","timestamp":1676676253000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054369"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540646822","9783540691068"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0054369","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"26 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}