{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T13:25:12Z","timestamp":1649078712403},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":7471,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0012-365x(93)90168-s","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"333-344","source":"Crossref","is-referenced-by-count":2,"title":["On some partial line graphs of a hypergraph and the associated matroid"],"prefix":"10.1016","volume":"111","author":[{"given":"Philippe","family":"J\u00e9gou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Catherine","family":"Vilarem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(93)90168-S_BIB1","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0095-8956(82)90056-9","article-title":"Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality","volume":"33","author":"Acharya","year":"1982","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(93)90168-S_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. ACM"},{"key":"10.1016\/0012-365X(93)90168-S_BIB3","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1970"},{"key":"10.1016\/0012-365X(93)90168-S_BIB4","series-title":"Hypergraphes","author":"Berge","year":"1987"},{"key":"10.1016\/0012-365X(93)90168-S_BIB5","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0210059","article-title":"Power of natural semijoins","volume":"10","author":"Bernstein","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0012-365X(93)90168-S_BIB6","article-title":"On hypergraph acyclicity and graph chordality","volume":"170","author":"D'Atri","year":"1986","journal-title":"Report IASI-CNR R."},{"key":"10.1016\/0012-365X(93)90168-S_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","article-title":"Network-based heuristics for constraint satisfaction problems","volume":"34","author":"Dechter","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0012-365X(93)90168-S_BIB8","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\/0012-365X(93)90168-S_BIB9","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/322290.322292","article-title":"A sufficient condition of backtrack-free search","volume":"29","author":"Freuder","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0012-365X(93)90168-S_BIB10","first-page":"99","article-title":"On a property of hypergraphs with no cycles of length greater than two","volume":"Vol. 411","author":"Hansen","year":"1974"},{"key":"10.1016\/0012-365X(93)90168-S_BIB11","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1109\/TAI.1989.65349","article-title":"A filtering process for general constraint satisfaction problems: achieving pairwise-consistency using an associated binary representation","author":"Janssen","year":"1989","journal-title":"Proc. IEEE Workshop on Tools for Artificial Intelligence"},{"key":"10.1016\/0012-365X(93)90168-S_BIB12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: fundamentals properties and application to picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Inform. Sci."},{"key":"10.1016\/0012-365X(93)90168-S_BIB13","series-title":"The Psychology of Computer Vision","article-title":"Understanding line drawings of scenes with shadows","author":"Waltz","year":"1975"},{"key":"10.1016\/0012-365X(93)90168-S_BIB14","doi-asserted-by":"crossref","first-page":"509","DOI":"10.2307\/2371182","article-title":"On the abstract properties of linear dependence","volume":"57","author":"Whitney","year":"1935","journal-title":"Am. J. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390168S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9390168S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:51:46Z","timestamp":1555134706000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9390168S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["0012365X9390168S"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(93)90168-s","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}