{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:06:38Z","timestamp":1773324398732,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5311,"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":[[1999,1]]},"DOI":"10.1016\/s0166-218x(98)00137-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"287-292","source":"Crossref","is-referenced-by-count":3,"title":["Construction of a simple elimination scheme for a chordal comparability graph in linear time"],"prefix":"10.1016","volume":"91","author":[{"given":"Richard B.","family":"Borie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy P.","family":"Spinrad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00137-1_BIB1","series-title":"20th International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"65","article-title":"The algorithmic use of hypertree structure and maximum neighborhood orderings","volume":"vol. 903","author":"Brandstadt","year":"1995"},{"key":"10.1016\/S0166-218X(98)00137-1_BIB15","unstructured":"Discrete Appl. Math., to appear."},{"key":"10.1016\/S0166-218X(98)00137-1_BIB2","series-title":"Generalized strongly chordal graphs, Manuscript","author":"Dahlhaus","year":"1993"},{"key":"10.1016\/S0166-218X(98)00137-1_BIB3","series-title":"On the computational complexity of matching and multidimensional matching in chordal and strongly chordal graphs, Manuscript","author":"Dahlhaus","year":"1994"},{"key":"10.1016\/S0166-218X(98)00137-1_BIB4","series-title":"23rd International Workshop on Graph-Theoretic Concepts in Computer Science","first-page":"184","article-title":"On greedy matching ordering and greedy matchable graphs","volume":"vol. 1335","author":"Dragan","year":"1997"},{"key":"10.1016\/S0166-218X(98)00137-1_BIB5","article-title":"Applications of linear programming duality to problems involving independence and domination","author":"Farber","year":"1982"},{"key":"10.1016\/S0166-218X(98)00137-1_BIB6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","article-title":"Domination, independent domination, and duality in strongly chordal graphs","volume":"7","author":"Farber","year":"1984","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(98)00137-1_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbare graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"10.1016\/S0166-218X(98)00137-1_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(98)00137-1_BIB9","doi-asserted-by":"crossref","unstructured":"W. Hsu, T.H. Ma, Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs, SIAM J. Comput., to appear.","DOI":"10.1137\/S0097539792224814"},{"key":"10.1016\/S0166-218X(98)00137-1_BIB10","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/BF00814403","article-title":"The dimension of cycle-free orders","volume":"9","author":"Kierstead","year":"1992","journal-title":"Order"},{"key":"10.1016\/S0166-218X(98)00137-1_BIB11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0012-365X(85)90156-6","article-title":"A characterization of totally balanced hypergraphs","volume":"57","author":"Lehel","year":"1985","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(98)00137-1_BIB12","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF00385814","article-title":"Cycle-free partial orders and chordal comparability graphs","volume":"8","author":"Ma","year":"1991","journal-title":"Order"},{"key":"10.1016\/S0166-218X(98)00137-1_BIB13","series-title":"8th ACM-SIAM Symposium on Discrete Algorithms","first-page":"19","article-title":"Linear-time transitive orientation","author":"McConnell","year":"1997"},{"key":"10.1016\/S0166-218X(98)00137-1_BIB14","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."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001371?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001371?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:52:53Z","timestamp":1556117573000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98001371"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0166218X98001371"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00137-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}