{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:45:36Z","timestamp":1767771936357},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"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":5342,"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":[[1998,12]]},"DOI":"10.1016\/s0166-218x(98)00123-1","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"155-168","source":"Crossref","is-referenced-by-count":26,"title":["Minimal vertex separators of chordal graphs"],"prefix":"10.1016","volume":"89","author":[{"given":"P.Sreenivasa","family":"Kumar","sequence":"first","affiliation":[]},{"given":"C.E.Veni","family":"Madhavan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(98)00123-1_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0166-218X(98)00123-1_BIB2","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1145\/2402.322389","article-title":"On the desirability of acyclic database schemes","volume":"30","author":"Beeri","year":"1983","journal-title":"JACM"},{"key":"10.1016\/S0166-218X(98)00123-1_BIB3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02992776","article-title":"On rigid circuit graphs","volume":"25","author":"Dirac","year":"1961","journal-title":"Abh. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/S0166-218X(98)00123-1_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\/S0166-218X(98)00123-1_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0166-218X(98)00123-1_BIB6","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\/S0166-218X(98)00123-1_BIB7","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\/S0166-218X(98)00123-1_BIB8","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\/S0166-218X(98)00123-1_BIB9","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\/S0166-218X(98)00123-1_BIB10","series-title":"Proc. R.C.Bose Memorial Conf. on Combinatorial Mathematics and Applications","article-title":"Clique hypergraphs of chordal graphs and subclasses","author":"Kumar","year":"1988"},{"key":"10.1016\/S0166-218X(98)00123-1_BIB11","article-title":"Algorithmic and structural results on chordal graphs","author":"Kumar","year":"1990"},{"key":"10.1016\/S0166-218X(98)00123-1_BIB12","series-title":"Proc. National Symp. on Theoretical Computer Science","first-page":"37","article-title":"2-Separator Chordal Graphs","author":"Kumar","year":"1993"},{"issue":"3","key":"10.1016\/S0166-218X(98)00123-1_BIB13","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1137\/0213035","article-title":"Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs and selectively reduce acyclic hypergraphs","volume":"13","author":"Tarjan","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(98)00123-1_BIB14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0190(92)90254-S","article-title":"A linear-time algorithm for isomorphism of a subclass of chordal graphs","volume":"44","author":"Veeraraghavulu","year":"1992","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001231?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X98001231?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:36Z","timestamp":1556117556000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X98001231"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0166218X98001231"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(98)00123-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}