{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T20:50:42Z","timestamp":1698526242826},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"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":7351,"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":[[1993,6]]},"DOI":"10.1016\/0166-218x(93)90116-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"261-295","source":"Crossref","is-referenced-by-count":15,"title":["A faster algorithm to recognize undirected path graphs"],"prefix":"10.1016","volume":"43","author":[{"given":"Alejandro A.","family":"Sch\u00e4ffer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)90116-6_BIB1","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":"J. ACM"},{"key":"10.1016\/0166-218X(93)90116-6_BIB2","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","article-title":"Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms","volume":"13","author":"Booth","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(93)90116-6_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\/0166-218X(93)90116-6_BIB4","series-title":"TR 84-628 (Ph.D. Thesis)","article-title":"Intersection graph algorithms","author":"Dietz","year":"1984"},{"key":"10.1016\/0166-218X(93)90116-6_BIB5","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","article-title":"Degrees of acyclicity for hypergraphs and relational database schemes","volume":"30","author":"Fagin","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(93)90116-6_BIB6","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(93)90116-6_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 Ser. B"},{"key":"10.1016\/0166-218X(93)90116-6_BIB8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0012-365X(75)90021-7","article-title":"A recognition algorithm for the intersection graphs of directed paths in directed trees","volume":"13","author":"Gavril","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)90116-6_BIB9","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0012-365X(78)90070-5","article-title":"A recognition algorithm for the intersection graphs of paths in trees","volume":"23","author":"Gavril","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(93)90116-6_BIB10","doi-asserted-by":"crossref","first-page":"539","DOI":"10.4153\/CJM-1964-055-5","article-title":"A characterization of comparability graphs and interval graphs","volume":"16","author":"Gilmore","year":"1964","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(93)90116-6_BIB11","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(93)90116-6_BIB12","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","article-title":"The NP-completeness column: an ongoing guide","volume":"6","author":"Johnson","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(93)90116-6_BIB13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0095-8956(86)90042-0","article-title":"Intersection graphs of paths in a tree","volume":"41","author":"Monma","year":"1986","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0166-218X(93)90116-6_BIB14","series-title":"TR 90-1096 (Ph.D. Thesis)","article-title":"Parallel algorithms for intersection graphs","author":"Novick","year":"1990"},{"key":"10.1016\/0166-218X(93)90116-6_BIB15","doi-asserted-by":"crossref","first-page":"501","DOI":"10.2140\/pjm.1970.34.501","article-title":"Intersection representations of graphs by arcs","volume":"34","author":"Renz","year":"1970","journal-title":"Pacific J. Math."},{"key":"10.1016\/0166-218X(93)90116-6_BIB16","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(93)90116-6_BIB17","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(93)90116-6_BIB18","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(93)90116-6_BIB19","doi-asserted-by":"crossref","first-page":"566","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\/0166-218X(93)90116-6_BIB20","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0020-0190(87)90107-4","article-title":"The maximum k-colorable subgraph problem for chordal graphs","volume":"24","author":"Yannakakis","year":"1987","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93901166?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93901166?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:25:10Z","timestamp":1555136710000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93901166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["0166218X93901166"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)90116-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}