{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:44:08Z","timestamp":1774946648373,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,3,1]],"date-time":"1984-03-01T00:00:00Z","timestamp":446947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10730,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1984,3]]},"DOI":"10.1016\/0166-218x(84)90008-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"325-331","source":"Crossref","is-referenced-by-count":34,"title":["Some aspects of perfect elimination orderings in chordal graphs"],"prefix":"10.1016","volume":"7","author":[{"given":"D.R.","family":"Shier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(84)90008-8_BIB1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(74)90002-8","article-title":"A characterisation of rigid circuit graphs","volume":"9","author":"Buneman","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(84)90008-8_BIB2","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1007\/BF01581045","article-title":"Polynomially bounded algorithms for locating p-centers on a tree","volume":"22","author":"Chandrasekaran","year":"1982","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(84)90008-8_BIB3","first-page":"71","volume":"25","author":"Dirac","year":"1961"},{"key":"10.1016\/0166-218X(84)90008-8_BIB4","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\/0166-218X(84)90008-8_BIB5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","article-title":"Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph","volume":"1","author":"Gavril","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(84)90008-8_BIB6","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(84)90008-8_BIB7","doi-asserted-by":"crossref","unstructured":"M. Golumbic, Algorithmic aspects of perfect graphs, Ann. Discrete Math., to appear.","DOI":"10.1016\/S0304-0208(08)72942-6"},{"key":"10.1016\/0166-218X(84)90008-8_BIB8","unstructured":"A. Hoffman and M. Sakarovitch, personal communication."},{"key":"10.1016\/0166-218X(84)90008-8_BIB9","first-page":"535","article-title":"Copoints in antimatroids","volume":"29","author":"Jamison","year":"1980","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0166-218X(84)90008-8_BIB10","series-title":"Convexity and Related Combinatorial Geometry","first-page":"113","article-title":"A perspective on abstract convexity: classifying alignments by varieties","author":"Jamison","year":"1982"},{"key":"10.1016\/0166-218X(84)90008-8_BIB11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4064\/fm-51-1-45-64","article-title":"Representation of a finite graph by a set of intervals on the real line","volume":"51","author":"Lekkerkerker","year":"1962","journal-title":"Fund. Math."},{"key":"10.1016\/0166-218X(84)90008-8_BIB12","series-title":"Nonlinear Programming","author":"Mangasarian","year":"1969"},{"key":"10.1016\/0166-218X(84)90008-8_BIB13","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1137\/0208031","article-title":"Scheduling interval-ordered tasks","volume":"8","author":"Papadimitriou","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(84)90008-8_BIB14","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/0022-247X(70)90282-9","article-title":"Triangulated graphs and the elimination process","volume":"32","author":"Rose","year":"1970","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0166-218X(84)90008-8_BIB15","series-title":"Graph Theory and Computing","first-page":"183","article-title":"A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations","author":"Rose","year":"1972"},{"key":"10.1016\/0166-218X(84)90008-8_BIB16","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":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(84)90008-8_BIB17","series-title":"Maximum cardinality search and chordal graphs","author":"Tarjan","year":"1976"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84900088?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X84900088?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:26:52Z","timestamp":1555136812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X84900088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,3]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,3]]}},"alternative-id":["0166218X84900088"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(84)90008-8","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1984,3]]}}}