An Algorithm for Reducing Acyclic Hypergraphs.

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)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1982
Accession Number
ADA118535

Entities

People

  • Gabriel M. Kuper

Organizations

  • Stanford University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Air Force
  • Algorithms
  • Classification
  • Computer Science
  • Computers
  • Databases
  • Information Science
  • Optimization
  • Scientific Research
  • Security
  • Universities

Fields of Study

  • Computer science

Readers

  • Graph Algorithms and Convex Optimization.