{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T11:56:23Z","timestamp":1772366183996,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3613,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s0304-3975(03)00221-4","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T19:58:54Z","timestamp":1053374334000},"page":"303-317","source":"Crossref","is-referenced-by-count":23,"title":["Generating and characterizing the perfect elimination orderings of a chordal graph"],"prefix":"10.1016","volume":"307","author":[{"given":"L.S.","family":"Chandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Ibarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Ruskey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Sawada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(03)00221-4_BIB1","series-title":"Matroid Applications","article-title":"Introduction to greedoids","author":"Bj\u00f6rner","year":"1992"},{"key":"10.1016\/S0304-3975(03)00221-4_BIB2","doi-asserted-by":"crossref","unstructured":"J.R.S. Blair, B. Peyton, An introduction to chordal graphs and clique trees, Graph Theory and Sparse Matrix Computation, Springer, Berlin, Vol. 56, 1993, pp. 1\u201329.","DOI":"10.1007\/978-1-4613-8369-7_1"},{"key":"10.1016\/S0304-3975(03)00221-4_BIB3","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterization of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(03)00221-4_BIB4","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/BF00288685","article-title":"Optimal scheduling for two-processor systems","volume":"1","author":"Coffman","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(03)00221-4_BIB5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"24","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/S0304-3975(03)00221-4_BIB6","doi-asserted-by":"crossref","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","article-title":"Incidence matrices and interval graphs","volume":"15","author":"Fulkerson","year":"1965","journal-title":"Pacific J. Math."},{"key":"10.1016\/S0304-3975(03)00221-4_BIB7","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","article-title":"The intersection graphs of subtrees in trees are exactly the chordal graphs","volume":"16","author":"Gavril","year":"1974","journal-title":"J. Combin. Theory B"},{"key":"10.1016\/S0304-3975(03)00221-4_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0304-3975(03)00221-4_BIB9","series-title":"Greedoids","author":"Korte","year":"1991"},{"key":"10.1016\/S0304-3975(03)00221-4_BIB10","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(98)00123-1","article-title":"Minimal vertex separators of chordal graphs","volume":"89","author":"Kumar","year":"1998","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(03)00221-4_BIB11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01110545","article-title":"Gray codes for antimatroids","volume":"10","author":"Pruesse","year":"1993","journal-title":"Order"},{"issue":"2","key":"10.1016\/S0304-3975(03)00221-4_BIB12","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1137\/S0097539791202647","article-title":"Generating linear extensions fast","volume":"23","author":"Pruesse","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00221-4_BIB13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1137\/0205021","article-title":"Algorithmic aspects of vertex elimination on graphs","volume":"5","author":"Rose","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00221-4_BIB14","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0166-218X(84)90008-8","article-title":"Some aspects of perfect elimination orderings in chordal graphs","volume":"7","author":"Shier","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(03)00221-4_BIB15","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0020-0190(95)00024-7","article-title":"A note on lexicographic breadth first search for chordal graphs","volume":"54","author":"Simon","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(03)00221-4_BIB16","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithm to test chordality of graphs, test acyclicity of hypergraphs, and selectivity reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(03)00221-4_BIB17","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1002\/jgt.3190020311","article-title":"Representations of chordal graphs as subtrees of a tree","volume":"2","author":"Walter","year":"1978","journal-title":"J. Graph Theory"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002214?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397503002214?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T09:22:18Z","timestamp":1553160138000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397503002214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0304397503002214"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(03)00221-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}