Report Number: CS-TR-82-892
Institution: Stanford University, Department of Computer Science
Title: An algorithm for reducing acyclic hypergraphs
Author: Kuper, Gabriel M.
Date: January 1982
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.