{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:54:42Z","timestamp":1757627682829,"version":"3.44.0"},"reference-count":22,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CC -86-05353","DCR-85-11713"],"award-info":[{"award-number":["CC -86-05353","DCR-85-11713"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0304-3975(90)90030-l","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"97-117","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":26,"title":["Dynamic maintenance of directed hypergraphs"],"prefix":"10.1016","volume":"72","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[]},{"given":"Umberto","family":"Nanni","sequence":"additional","affiliation":[]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(90)90030-L_BIB1","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"Adelson-Velskii","year":"1962","journal-title":"Soviet Math. Dokl."},{"key":"10.1016\/0304-3975(90)90030-L_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","article-title":"The transitive reduction of a directed graph","volume":"1","author":"Aho","year":"1972","journal-title":"SIAM J. Comput."},{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0304-3975(90)90030-L_BIB3"},{"key":"10.1016\/0304-3975(90)90030-L_BIB4","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1145\/2157.322404","article-title":"Graph algorithms for functional dependency manipulation","volume":"30","author":"Ausiello","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90030-L_BIB5","series-title":"Analysis and Design of Algorithms for Combinatorial Problems","first-page":"1","article-title":"Strongly equivalent directed hypergraphs","volume":"25","author":"Ausiello","year":"1985"},{"key":"10.1016\/0304-3975(90)90030-L_BIB6","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0215029","article-title":"Minimal representation of directed hypergraphs","volume":"15","author":"Ausiello","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(90)90030-L_BIB7","unstructured":"G. Ausiello and G. F. Italiano, On-line algorithms for polynomially solvable satisfiability problems, J. Logic Programming, to appear."},{"key":"10.1016\/0304-3975(90)90030-L_BIB8","article-title":"Incremental minimal length path","author":"Ausiello","year":"1990","journal-title":"Proc. 1st Ann. ACM-SIAM Symp. on Discrete Algorithms"},{"key":"10.1016\/0304-3975(90)90030-L_BIB9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indices","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"year":"1973","series-title":"Graphs and Hypergraphs","author":"Berge","key":"10.1016\/0304-3975(90)90030-L_BIB10"},{"key":"10.1016\/0304-3975(90)90030-L_BIB11","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(77)90014-5","article-title":"Directed recursive labelnode hypergraphs: A new representation language","volume":"9","author":"Boley","year":"1977","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0304-3975(90)90030-L_BIB12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0743-1066(84)90014-1","article-title":"Linear-time algorithms for testing the satisfiability of propositional Horn formulae","volume":"3","author":"Dowling","year":"1984","journal-title":"J. Logic Programming"},{"key":"10.1016\/0304-3975(90)90030-L_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/322234.322235","article-title":"An on-line edge deletion problem","volume":"28","author":"Even","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90030-L_BIB14","series-title":"Proc. CAAP 83","first-page":"65","article-title":"Acyclyc database schemes of various degrees: A painless introduction","volume":"159","author":"Fagin","year":"1983"},{"key":"10.1016\/0304-3975(90)90030-L_BIB15","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1145\/322276.322285","article-title":"Dynamic programming as graph searching: An algebraic approach","volume":"28","author":"Gnesi","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(90)90030-L_BIB16","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0304-3975(86)90098-8","article-title":"Amortized efficiency of a path retrieval data structure","volume":"48","author":"Italiano","year":"1986","journal-title":"Theoret. Comput. Sci."},{"year":"1979","series-title":"Logic for Problem Solving","author":"Kowalski","key":"10.1016\/0304-3975(90)90030-L_BIB17"},{"key":"10.1016\/0304-3975(90)90030-L_BIB18","series-title":"Technical Report RUU-CS-87-25","article-title":"Maintenance of transitive closure and transitive reduction of graphs","author":"La Poutr\u00e9","year":"1987"},{"year":"1982","series-title":"Principles of Artificial Intelligence","author":"Nilsson","key":"10.1016\/0304-3975(90)90030-L_BIB19"},{"key":"10.1016\/0304-3975(90)90030-L_BIB20","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(83)90006-5","article-title":"A data structure for dynamic trees","volume":"26","author":"Sleator","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(90)90030-L_BIB21","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","article-title":"Amortized computational complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0304-3975(90)90030-L_BIB22","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/322326.322333","article-title":"A theory of safe locking policies in database systems","volume":"29","author":"Yannakakis","year":"1982","journal-title":"J. ACM"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090030L?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759090030L?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T04:18:34Z","timestamp":1757477914000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759090030L"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":22,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["030439759090030L"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(90)90030-l","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1990,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Dynamic maintenance of directed hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0304-3975(90)90030-L","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}