{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T19:41:56Z","timestamp":1709408516673},"reference-count":28,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1988,11,1]],"date-time":"1988-11-01T00:00:00Z","timestamp":594345600000},"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":[[1988,11]]},"DOI":"10.1016\/0020-0190(88)90121-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"271-274","source":"Crossref","is-referenced-by-count":17,"title":["On hypergraph acyclicity and graph chordality"],"prefix":"10.1016","volume":"29","author":[{"given":"Alessandro","family":"D'Atri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marina","family":"Moscarini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90121-4_BIB1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF02579287","article-title":"Hypergraphs with no special cycles","volume":"3","author":"Anstee","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(88)90121-4_BIB2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0196-6774(84)90028-2","article-title":"Characterizations of totally balanced matrices","volume":"5","author":"Anstee","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(88)90121-4_BIB3","first-page":"27","article-title":"Minimal coverings of acyclic database schemata","volume":"Vol. 2","author":"Ausiello","year":"1984"},{"key":"10.1016\/0020-0190(88)90121-4_BIB4","doi-asserted-by":"crossref","DOI":"10.1016\/0022-0000(86)90018-8","article-title":"Chordality properties on graphs and minimal conceptual connections in semantic data models","volume":"33","author":"Ausiello","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(88)90121-4_BIB5","unstructured":"H.-J. Bandelt and H.M. Mulder, Distance-hereditary graphs, J. Combin. Theory, Serie B, to appear."},{"key":"10.1016\/0020-0190(88)90121-4_BIB6","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\/0020-0190(88)90121-4_BIB7","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1976"},{"key":"10.1016\/0020-0190(88)90121-4_BIB8","first-page":"43","article-title":"Recognition algorithms and design methodology for acyclic database schemes","volume":"Vol. 3","author":"D'Atri","year":"1986"},{"key":"10.1016\/0020-0190(88)90121-4_BIB9","author":"D'Atri","year":"1986","journal-title":"Cross Graphs, Steiner Trees and Connected Domination"},{"key":"10.1016\/0020-0190(88)90121-4_BIB10","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/2402.322390","article-title":"Degree of acyclicity for hypergraphs and relational database schemes","volume":"30","author":"Fagin","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(88)90121-4_BIB11","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":"Discr. Math."},{"key":"10.1016\/0020-0190(88)90121-4_BIB12","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0012-365X(85)80009-1","article-title":"Hypergraphs without a large star","volume":"55","author":"F\u00fcredi","year":"1985","journal-title":"Discr. Math."},{"key":"10.1016\/0020-0190(88)90121-4_BIB13","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0020-0190(88)90121-4_BIB14","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1145\/319758.319775","article-title":"Tree queries: A simple class of relational queries","volume":"7","author":"Goodman","year":"1982","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0020-0190(88)90121-4_BIB15","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1145\/2157.322405","article-title":"Syntactic characterization of tree database schemas","volume":"30","author":"Goodman","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(88)90121-4_BIB16","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0020-0190(88)90121-4_BIB17","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0020-0190(80)90114-3","article-title":"Testing the universal instance assumption","volume":"10","author":"Honeyman","year":"1980","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0020-0190(88)90121-4_BIB18","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","article-title":"A characterization of distance-hereditary graphs","volume":"28","author":"Howorka","year":"1977","journal-title":"Quart. J. Math. Oxford"},{"key":"10.1016\/0020-0190(88)90121-4_BIB19","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0095-8956(79)90069-8","article-title":"On metric properties of certain clique graphs","volume":"27","author":"Howorka","year":"1979","journal-title":"J. Combin. Theory, Serie B"},{"key":"10.1016\/0020-0190(88)90121-4_BIB20","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1002\/jgt.3190050314","article-title":"A characterization of ptolemaic graphs","volume":"5","author":"Howorka","year":"1981","journal-title":"J. Graph Theory"},{"key":"10.1016\/0020-0190(88)90121-4_BIB21","doi-asserted-by":"crossref","first-page":"342","DOI":"10.4153\/CJM-1965-034-0","article-title":"A characterization of certain ptolemaic graphs","volume":"17","author":"Kay","year":"1965","journal-title":"Canad. J. Math."},{"issue":"A","key":"10.1016\/0020-0190(88)90121-4_BIB22","first-page":"239","article-title":"Helly hypergraphs and abstract interval structures","volume":"16","author":"Lehel","year":"1983","journal-title":"Ars Combin."},{"key":"10.1016\/0020-0190(88)90121-4_BIB23","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":"Discr. Math."},{"key":"10.1016\/0020-0190(88)90121-4_BIB24","series-title":"Combinatorial Problems and Exercises","author":"Lov\u00e1sz","year":"1979"},{"key":"10.1016\/0020-0190(88)90121-4_BIB25","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0304-3975(84)90030-6","article-title":"Connections in acyclic hypergraphs","volume":"32","author":"Maier","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(88)90121-4_BIB26","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\/0020-0190(88)90121-4_BIB27","first-page":"82","article-title":"Algorithms for acyclic databases schemes","author":"Yannakakis","year":"1981","journal-title":"Proc. 7th Conf. on Very Large Data Base"},{"key":"10.1016\/0020-0190(88)90121-4_BIB28","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230150109","article-title":"Steiner trees, connected domination and strongly chordal graphs","volume":"5","author":"White","year":"1985","journal-title":"Networks"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901214?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019088901214?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T15:35:34Z","timestamp":1583940934000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019088901214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,11]]},"references-count":28,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1988,11]]}},"alternative-id":["0020019088901214"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90121-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,11]]}}}