{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:06:21Z","timestamp":1725663981418},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540540298"},{"type":"electronic","value":"9783540473596"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54029-6_185","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:24:36Z","timestamp":1330208676000},"page":"372-382","source":"Crossref","is-referenced-by-count":1,"title":["Practical parallel algorithms for chordal graphs"],"prefix":"10.1007","author":[{"given":"Eric S.","family":"Kirsch","sequence":"first","affiliation":[]},{"given":"Jean R. S.","family":"Blair","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"3","key":"37_CR1","first-page":"205","volume":"30","author":"C. Beeri","year":"1974","unstructured":"C. Beeri, R. Fagin, D. Maier and M. Yannakakis, \u201cOn the desirability of acyclic database schemes,\u201d Journal of the Association for Computing Machinery vol. 30, no. 3, pp. 205\u2013212, 1974.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"37_CR2","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, London, 1980."},{"key":"37_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0020-0190(88)90178-0","volume":"28","author":"C. Ho","year":"1988","unstructured":"C. Ho and R. C. T. Lee, \u201cEfficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs,\u201d Information Processing Letters Vol. 28, pp. 301\u2013309, 1988.","journal-title":"Information Processing Letters"},{"key":"37_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0020-0190(89)90070-7","volume":"31","author":"C. Ho","year":"1989","unstructured":"C. Ho and R. C. Lee, \u201cCounting clique trees and perfect elimination schemes in parallel,\u201d Information Processing Letters Vol. 31, pp. 61\u201368, 1989.","journal-title":"Information Processing Letters"},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"P. N. Klein, \u201cEfficient parallel algorithms for chordal graphs,\u201d Symposium on Foundations of Computer Science, pp. 150\u2013161, October 1988.","DOI":"10.1109\/SFCS.1988.21933"},{"key":"37_CR6","doi-asserted-by":"crossref","unstructured":"J. Naor, M. Naor, A. A. Schaffer, \u201cFast parallel algorithms for chordal graphs,\u201d Proceedings 19th Annual ACM Symposium on Theory of Computing, pp. 355\u2013364, 1987.","DOI":"10.1145\/28395.28433"},{"key":"37_CR7","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"C. Papadimitriou","year":"1990","unstructured":"C. Papadimitriou and M. Yannakakis \u201cTowards an Architecture Independent Analysis of Parallel Algorithms,\u201d SIAM Journal of Computing Vol. 19, pp. 322\u2013328, April 1990.","journal-title":"SIAM Journal of Computing"},{"key":"37_CR8","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"D. J. Rose","year":"1970","unstructured":"D. J. Rose, \u201cTriangulated Graphs and the Elimination Process,\u201d Journal of Mathematical Analysis and Applications, Vol. 32, pp. 597\u2013609, 1970.","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"37_CR9","first-page":"183","volume-title":"Graph Theory and Computing","author":"D. J. Rose","year":"1973","unstructured":"D. J. Rose, \u201cA graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations,\u201d in Graph Theory and Computing, ed. R. Read, pp. 183\u2013217, Academic Press, New York, 1973."}],"container-title":["Lecture Notes in Computer Science","Advances in Computing and Information \u2014 ICCI '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54029-6_185.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:18:38Z","timestamp":1619572718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54029-6_185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540540298","9783540473596"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-54029-6_185","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}