BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-82-892
       ENTRY:: June 01, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: An algorithm for reducing acyclic hypergraphs
        TYPE:: Technical Report
      AUTHOR:: Kuper, Gabriel M.
        DATE:: January 1982
       PAGES:: 10
    ABSTRACT:: This report is a description of an algorithm to compute
               efflciently the Graham reduction of an acyclic hypergraph
               with sacred nodes. To apply the algorithm we must already
               have a tree representation of the hypergraphs, and therefore
               it is useful when we have a fixed hypergraph and wish to
               compute Graham reductions many times, as we do in the
               Systern/U query interpretation algorithm.
       NOTES:: [Adminitrivia V1/Prg/19950601]
         END:: STAN//CS-TR-82-892