{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:07:32Z","timestamp":1773324452852,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0020-0190(03)00228-x","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"299-302","source":"Crossref","is-referenced-by-count":3,"title":["From a simple elimination ordering to a strong elimination ordering in linear time"],"prefix":"10.1016","volume":"86","author":[{"given":"J.","family":"Sawada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.P.","family":"Spinrad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(03)00228-X_BIB001","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0166-218X(98)00137-1","article-title":"Construction of a simple elimination scheme for a chordal comparability graph in linear time","volume":"91","author":"Borie","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(03)00228-X_BIB002","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","article-title":"Characterizations of strongly chordal graphs","volume":"43","author":"Farber","year":"1983","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(03)00228-X_BIB003","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0020-0190(03)00228-X_BIB004","doi-asserted-by":"crossref","first-page":"854","DOI":"10.1137\/0216057","article-title":"Doubly lexical orderings of matrices","volume":"16","author":"Lubiw","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(03)00228-X_BIB005","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three partition refinement algorithms","volume":"16","author":"Paige","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(03)00228-X_BIB006","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0190(93)90209-R","article-title":"Doubly lexical ordering of dense 0\u20131 matrices","volume":"45","author":"Spinrad","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(03)00228-X_BIB007","series-title":"ICALP","first-page":"993","article-title":"Linear time algorithms on chordal bipartite and strongly chordal graphs","author":"Uehara","year":"2002"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900300228X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002001900300228X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T23:56:59Z","timestamp":1553212619000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002001900300228X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S002001900300228X"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(03)00228-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}