GENERATIONS OF TREES WITHOUT DUPLICATIONS,

Abstract

The purpose of this note is to describe a procedure for generating all trees of a linear graph without duplication. The trees are generated in a systematic fashion by elementary tree transformations (replacement of one branch), and hence the sign computation is performed simply. Since the procedure guarantees that there is no duplication, networks in which the number of trees exceeds the fast memory available in a computer, can be handled. The procedure requires that one generate a starting tree, which is easy to do on a machine, and that one compute the fundamental cut-sets for a given tree, which is again easy to do. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1964
Accession Number
AD0604653

Entities

People

  • S. Seshu
  • W. Mayed

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Computations
  • Computers
  • Computing Devices
  • Demographic Cohorts
  • Demography
  • Guarantees
  • Mathematical Analysis

Readers

  • Aerospace Test and Evaluation
  • Graph Algorithms and Convex Optimization.
  • Operations Research