Accession Number : ADA118535

Title :   An Algorithm for Reducing Acyclic Hypergraphs.

Descriptive Note : Technical rept.,

Corporate Author : STANFORD UNIV CA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Kuper,Gabriel M

PDF Url : ADA118535

Report Date : Jan 1982

Pagination or Media Count : 11

Abstract : The report gives a description of an algorithm to compute efficiently 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 System/U query interpretation algorithm. (Author)

Descriptors :   *Algorithms, Reduction, Data bases, Computations, Optimization, Trees, Systems analysis, Nodes, Semantics

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE