Directed hypergraphs: Data structures and applications

  • Giorgio Ausiello
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 299)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [ADS 83]
    G. Ausiello, A. D'Atri, D. Saccà, "Graph algorithms for functional dependency manipulation", J. ACM, 30 (1983)Google Scholar
  2. [ADS 85]
    G. Ausiello, A. D'Atri, D. Saccà, "Strongly equivalent directed hypergraphs, in Analysis and Design of Algorithms for Combinatorial Problems, Annals of Discrete Mathematics, 25 (1985)Google Scholar
  3. [ADS 86]
    G. Ausiello, A.D'Atri, D.Saccà, "Minimal representation of directed hypergraphs", SIAM J. Comput., 15 (1986)Google Scholar
  4. [AGU 72]
    A.V. Aho, M.R. Garey, J.D. Ullman, "The transitive reduction of a directed graph", SIAM J. Comput., 1 (1972)Google Scholar
  5. [AI 87]
    G. Ausiello, G.F. Italiano, "On-line algorithms for polynomially 'solvable satisfiability problems", Rapp. DIS, Università "La Sapienza" di Roma (1987)Google Scholar
  6. [B 73]
    C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam, 1973Google Scholar
  7. [Bo 77]
    H. Boley, Directed recursive labelnode hypergraphs: A new representation language, Artificial Intelligence, 9 (1977)Google Scholar
  8. [DG 84]
    W.F. Dowling, J.H. Gallier, "Linear-time algorithms for testing the satisfiability of propositional Horn formulae", J. Logic Programming, 3 (1984)Google Scholar
  9. [ES 81]
    S. Even, Y. Shiloach, "An on-line edge deletion problems", J. ACM, 28 (1981)Google Scholar
  10. [F 83]
    R. Fagin, "Acyclyc database schemes of various degrees: A painless introduction", in Proceedings of CAAP 83, LNCS Vol. 159, Springer Verlag, 1983Google Scholar
  11. [GMM 81]
    S. Gnesi, U. Montanari, A. Martelli, "Dynamic programming as graph searching: An algebraic approach", J. ACM, 28, (1981)Google Scholar
  12. [N 82]
    N. J. Nilsson, Principles of Artificial Intelligence, Springer Verlag, 1982Google Scholar
  13. [ST 83]
    D.D. Sleator, R.E. Tarjan, "A data structure for dynamic trees", J. Comput. System Sci., 26 (1983)Google Scholar
  14. [T 85]
    R.E. Tarjan, "Amortized computational complexity", SIAM J on Alg. Disc. Meth., 6 (1985)Google Scholar
  15. [Y 82]
    M. Yannakakis, A theory of safe locking policies in Database Systems, J. ACM, 29 (1982)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Giorgio Ausiello
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma "La Sapienza"RomaItaly

Personalised recommendations