{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:43Z","timestamp":1763467723395},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354019021X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0026111","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T07:47:21Z","timestamp":1132645641000},"page":"295-303","source":"Crossref","is-referenced-by-count":4,"title":["Directed hypergraphs: Data structures and applications"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"G. Ausiello, A. D'Atri, D. Sacc\u00e0, \"Graph algorithms for functional dependency manipulation\", J. ACM, 30 (1983)","DOI":"10.1145\/2157.322404"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"G. Ausiello, A. D'Atri, D. Sacc\u00e0, \"Strongly equivalent directed hypergraphs, in Analysis and Design of Algorithms for Combinatorial Problems, Annals of Discrete Mathematics, 25 (1985)","DOI":"10.1016\/S0304-0208(08)73100-1"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"G. Ausiello, A.D'Atri, D.Sacc\u00e0, \"Minimal representation of directed hypergraphs\", SIAM J. Comput., 15 (1986)","DOI":"10.1137\/0215029"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"A.V. Aho, M.R. Garey, J.D. Ullman, \"The transitive reduction of a directed graph\", SIAM J. Comput., 1 (1972)","DOI":"10.1137\/0201002"},{"key":"20_CR5","unstructured":"G. Ausiello, G.F. Italiano, \"On-line algorithms for polynomially 'solvable satisfiability problems\", Rapp. DIS, Universit\u00e0 \"La Sapienza\" di Roma (1987)"},{"key":"20_CR6","unstructured":"C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973"},{"issue":"1","key":"20_CR7","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0004-3702(77)90014-5","volume":"9","author":"Harold Boley","year":"1977","unstructured":"H. Boley, Directed recursive labelnode hypergraphs: A new representation language, Artificial Intelligence, 9 (1977)","journal-title":"Artificial Intelligence"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"W.F. Dowling, J.H. Gallier, \"Linear-time algorithms for testing the satisfiability of propositional Horn formulae\", J. Logic Programming, 3 (1984)","DOI":"10.1016\/0743-1066(84)90014-1"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"S. Even, Y. Shiloach, \"An on-line edge deletion problems\", J. ACM, 28 (1981)","DOI":"10.1145\/322234.322235"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"R. Fagin, \"Acyclyc database schemes of various degrees: A painless introduction\", in Proceedings of CAAP 83, LNCS Vol. 159, Springer Verlag, 1983","DOI":"10.1007\/3-540-12727-5_3"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"S. Gnesi, U. Montanari, A. Martelli, \"Dynamic programming as graph searching: An algebraic approach\", J. ACM, 28, (1981)","DOI":"10.1145\/322276.322285"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"N. J. Nilsson, Principles of Artificial Intelligence, Springer Verlag, 1982","DOI":"10.1007\/978-3-662-09438-9"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"D.D. Sleator, R.E. Tarjan, \"A data structure for dynamic trees\", J. Comput. System Sci., 26 (1983)","DOI":"10.1016\/0022-0000(83)90006-5"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"R.E. Tarjan, \"Amortized computational complexity\", SIAM J on Alg. Disc. Meth., 6 (1985)","DOI":"10.1137\/0606031"},{"issue":"3","key":"20_CR15","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1145\/322326.322333","volume":"29","author":"Mihalis Yannakakis","year":"1982","unstructured":"M. Yannakakis, A theory of safe locking policies in Database Systems, J. ACM, 29 (1982)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","CAAP '88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0026111.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:55:57Z","timestamp":1607550957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0026111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354019021X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0026111","relation":{},"subject":[]}}