{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:12Z","timestamp":1759639032163},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606185"},{"type":"electronic","value":"9783540484875"}],"license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60618-1_88","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:48:44Z","timestamp":1330271324000},"page":"358-371","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Chordal graphs and their clique graphs"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Galinier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Habib","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christophe","family":"Paul","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"28_CR1","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 schemes. J. Assoc. Comput., 30:479\u2013513, 1983.","journal-title":"J. Assoc. Comput."},{"key":"28_CR2","unstructured":"C. Berge. Hypergraphs. North Hollands, 1989."},{"key":"28_CR3","unstructured":"J.R.S. Blair and B. Peyton. An introduction to chordal graphs and clique trees. preprint."},{"key":"28_CR4","unstructured":"O. Boruvka. On a minimal problem. Proc Moravske Predovedecke Spolecrosti, 3, 1926."},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00c4dt, F.F. Dragan, V.D. Chepoi, and V.I Voloshin. Dually chordal graphs. In Proceedings of the 19th Inter. Workshop on Graph-Theoretic Concept in Computer Science, 1993. WG93.","DOI":"10.1007\/3-540-57899-4_56"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","volume":"9","author":"P. Buneman","year":"1974","unstructured":"P. Buneman. A characterization of rigid circuit graphs. Discrete Math., 9:205\u2013212, 1974.","journal-title":"Discrete Math."},{"key":"28_CR7","volume-title":"Technical Report 27-94","author":"E. Dahlhaus","year":"1994","unstructured":"E. Dahlhaus, P.L. Hammer, F. Maffray, and S. Olariu. On domination elimination orderings and domination graphs. Technical Report 27-94, Rutgers University Center of Operations Research, P.O. Box 5062, New Brunswick, New Jersey, USA, August 1994."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"G.A. Dirac. On rigid circuit graphs. Abh. Math. Sem. Uni. Hamburg 25, 1961.","DOI":"10.1007\/BF02992776"},{"key":"28_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 a path in a tree are exactly the chordal graphs. Journ. Comb. Theory, 16:47\u201356, 1974.","journal-title":"Journ. Comb. Theory"},{"key":"28_CR10","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/0095-8956(85)90050-4","volume":"39","author":"Ryan B. B. Hayward","year":"1985","unstructured":"Ryan B. Hayward. Weakly triangulated graphs. Journal of Combinatorial theory, 39:200\u2013209, 1985. Serie B.","journal-title":"Journal of Combinatorial theory"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"B. K\u00f6rte, L. Lov\u00e1sz, and R. Schrader. Greedoids. Number 4 in Algorithms and Combinatorics. Springer Verlag, 1991.","DOI":"10.1007\/978-3-642-58191-5"},{"issue":"6","key":"28_CR12","doi-asserted-by":"crossref","first-page":"1146","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(6): 1146\u20131173, November 1989.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0166-218X(91)90056-3","volume":"31","author":"S. Olariu","year":"1991","unstructured":"S. Olariu. Some aspects of the semi-perfect elimination. Discrete Applied Mathematics, 31:291\u2013298, 1991.","journal-title":"Discrete Applied Mathematics"},{"key":"28_CR14","unstructured":"B. Peyton. Some applications of clique trees to the solutions of sparse linear systems. PhD thesis, Clemson University, 1986."},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"R.C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 1957.","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"28_CR16","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","volume":"32","author":"Donald J. J. Rose","year":"1970","unstructured":"Donald J. Rose. Triangulated graphs and the elimination process. Journal of Mathematical Analysus and Applications, 32:597\u2013609, 1970.","journal-title":"Journal of Mathematical Analysus and Applications"},{"issue":"2","key":"28_CR17","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"Donald J. J. Rose","year":"1976","unstructured":"Donald J. Rose, R. Endre Tarjan, and George S. Lueker. Algorithmic aspects of vertex elimination on graphs. SIAM Journal of Computing, 5(2):266\u2013283, June 1976.","journal-title":"SIAM Journal of Computing"},{"key":"28_CR18","volume-title":"Theory of Graphs","author":"P. Rosenstielh","year":"1967","unstructured":"P. Rosenstielh. L'arbre minimum d'un graphe. Theory of Graphs, 1967. P. Rosenstielh, editor, Gordon and Breach, New York."},{"key":"28_CR19","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1002\/jgt.3190120313","volume":"12","author":"Y. Shibata","year":"1988","unstructured":"Y. Shibata. On the tree representation of chordal graphs. Journal of Graph Theory, 12:421\u2013428, 1988.","journal-title":"Journal of Graph Theory"},{"key":"28_CR20","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R. E. Tarjan","year":"1984","unstructured":"R.E. Tarjan and M. Yannakakis. Simple linear algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergaphs. SIAM Journal of Computing, 13:566\u2013579, 1984.","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60618-1_88","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:39:11Z","timestamp":1558255151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60618-1_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606185","9783540484875"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-60618-1_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}