{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:43Z","timestamp":1725455923877},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023483","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:06:33Z","timestamp":1132383993000},"page":"487-498","source":"Crossref","is-referenced-by-count":0,"title":["Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs"],"prefix":"10.1007","author":[{"given":"Elias","family":"Dahlhaus","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0196-6774(89)90017-5","volume":"10","author":"K. Abrahamson","year":"1989","unstructured":"K. Abrahamson, N. Dadoun, D. Kirkpatrick, T. Przyticka, A Simple Parallel Tree Contraction Algorithm, Journal of Algorithms 10 (1989), pp. 287\u2013302.","journal-title":"Journal of Algorithms"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1145\/195613.195617","volume":"41","author":"M. Atallah","year":"1994","unstructured":"M. Atallah, M. Goodrich, S.R. Kosaraju, Parallel Algorithms for Evaluating Sequences of Set Manipulation Operations, Journal of the ACM 41 (1994), pp. 1049\u20131085.","journal-title":"Journal of the ACM"},{"key":"40_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":"40_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":"40_CR5","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0166-218X(94)90145-7","volume":"52","author":"E. Dahlhaus","year":"1994","unstructured":"E. Dahlhaus, P. Damaschke, The Complexity of Domination Problems in Chordal and Strongly Chordal Graphs, Discrete Applied Mathematics 52 (1994), pp. 261\u2013273.","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0166-218X(94)90093-0","volume":"51","author":"E. Dahlhaus","year":"1994","unstructured":"E. Dahlhaus, A fast parallel algorithm to compute Steiner-trees in strongly chordal graphs, Discrete Applied Mathematics 51 (1994), pp. 47\u201361.","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR7","first-page":"150","volume":"II","author":"E. Dahlhaus","year":"1994","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.","journal-title":"Proceedings of the 27-th Annual Hawaii International Conference on System Sciences"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/2402.322390","volume":"30","author":"R. Fagin","year":"1983","unstructured":"R. Fagin, Degrees of Acyclicity and Relational Database Schemes, Journal of the ACM 30 (1983), pp. 514\u2013550.","journal-title":"Journal of the ACM"},{"key":"40_CR9","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":"40_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"M. Farber","year":"1984","unstructured":"M. Farber, Domination, Independent Domination and Duality in Strongly Chordal Graphs, Discrete Applied Mathematics 7(1984), pp. 115\u2013130.","journal-title":"Discrete Applied Mathematics"},{"key":"40_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H. N. Gabow","year":"1984","unstructured":"H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci., 30 (1984), pp. 209\u2013221.","journal-title":"J. Comput. System Sci."},{"key":"40_CR12","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 Cobinatorial Theory Series B, vol. 16(1974), pp. 47\u201356.","journal-title":"Journal of Cobinatorial Theory Series B"},{"key":"40_CR13","first-page":"145","volume":"318","author":"J. Gilbert","year":"1988","unstructured":"J. Gilbert, H. Hafsteinsson, Parallel Solution of Sparse Linear Systems, SWAT 88 (1988), LNCS 318, pp. 145\u2013153.","journal-title":"LNCS"},{"key":"40_CR14","first-page":"150","volume":"29","author":"P. Klein","year":"1988","unstructured":"P. Klein, Efficient Parallel Algorithms for Chordal Graphs, 29. IEEE-FOCS (1988), pp. 150\u2013161.","journal-title":"IEEE-FOCS"},{"key":"40_CR15","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":"40_CR16","doi-asserted-by":"publisher","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":"40_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/S0895480191197210","volume":"8","author":"J. Spinrad","year":"1995","unstructured":"J. Spinrad, Nonredundant 1's in \u0413-free Matrices, SIAM Journal on Discrete Mathematics 8 (1995), pp. 251\u2013257.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"40_CR18","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":"40_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230150109","volume":"15","author":"K. White","year":"1985","unstructured":"K. White, M. Farber, W. Pulleyblank, Steiner Trees, Connected Domination, and Strongly Chordal Graphs, Networks 15 (1985), pp. 109\u2013124.","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T22:29:23Z","timestamp":1549319363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0023483","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}