{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T09:54:27Z","timestamp":1675936467113},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":4855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,4]]},"DOI":"10.1016\/s0304-3975(98)00128-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T02:30:39Z","timestamp":1027650639000},"page":"57-79","source":"Crossref","is-referenced-by-count":10,"title":["Decomposition of a hypergraph by partial-edge separators"],"prefix":"10.1016","volume":"237","author":[{"given":"Francesco Mario","family":"Malvestuto","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\/S0304-3975(98)00128-5_BIB1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1093\/biomet\/70.3.567","article-title":"Collapsibility and response variables in contingency tables","volume":"70","author":"Asmussen","year":"1983","journal-title":"Biometrika"},{"key":"10.1016\/S0304-3975(98)00128-5_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":"J. Assoc. Comput. Machinery"},{"key":"10.1016\/S0304-3975(98)00128-5_BIB3","unstructured":"C. Berge, Hypergraphs, North-Holland, Amsterdam, 1989."},{"key":"10.1016\/S0304-3975(98)00128-5_BIB4","unstructured":"Y.M. Bishop, S. Fienberg, P. Holland, Discrete Multivariate Analysis, MIT Press, Cambridge, MA, 1975."},{"key":"10.1016\/S0304-3975(98)00128-5_BIB5","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1214\/aos\/1176345006","article-title":"Markov fields and loglinear interaction models for contingency tables","volume":"8","author":"Darroch","year":"1980","journal-title":"Ann. Statist."},{"key":"10.1016\/S0304-3975(98)00128-5_BIB6","unstructured":"S. Even, Graph Algorithms, Pitman, London, 1979."},{"key":"10.1016\/S0304-3975(98)00128-5_BIB7","doi-asserted-by":"crossref","unstructured":"A. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1969.","DOI":"10.21236\/AD0705364"},{"key":"10.1016\/S0304-3975(98)00128-5_BIB8","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-9473(93)E0055-9","article-title":"On the effective implementation of the iterative proportional fitting procedure","volume":"19","author":"Jirousek","year":"1995","journal-title":"Comput. Statist. Data Anal."},{"key":"10.1016\/S0304-3975(98)00128-5_BIB9","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1017\/S1446788700027300","article-title":"Decomposable graphs and hypergraphs","volume":"36","author":"Lauritzen","year":"1984","journal-title":"J. Australian Math. Soc. Ser. A"},{"key":"10.1016\/S0304-3975(98)00128-5_BIB10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0012-365X(93)90510-Z","article-title":"Optimal decomposition by clique separators","volume":"113","author":"Leimer","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(98)00128-5_BIB11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0167-9473(89)90046-7","article-title":"Computing the maximum-entropy extension of given discrete probability distributions","volume":"8","author":"Malvestuto","year":"1989","journal-title":"Comput. Statist. Data Anal."},{"key":"10.1016\/S0304-3975(98)00128-5_BIB12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF00162528","article-title":"Testing implication of hierarchical log-linear models for probability distributions","volume":"6","author":"Malvestuto","year":"1996","journal-title":"Statist. Comput."},{"key":"10.1016\/S0304-3975(98)00128-5_BIB13","doi-asserted-by":"crossref","unstructured":"F.M. Malvestuto, M. Moscarini, A fast algorithm for query optimization in universal-relation databases, Proc. 3rd Italian Conf. on Advanced Database Systems (\u201cSistemi Evoluti per Basi di Dati\u201d), Ravello, 1995; J. Comput. System Sci. 56 (1998) 299\u2013309.","DOI":"10.1006\/jcss.1998.1570"},{"key":"10.1016\/S0304-3975(98)00128-5_BIB14","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","article-title":"Decomposition by clique separators","volume":"55","author":"Tarjan","year":"1985","journal-title":"Discrete Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001285?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001285?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T14:56:20Z","timestamp":1555253780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001285"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S0304397598001285"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00128-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}