SUBDIRECT DECOMPOSITIONS OF TRANSITION GRAPHS,

Abstract

In a preceding report canonical expressions for transition graphs and their direct products were derived. In this report, these expressions are applied to obtain an algorithm for the representation of a complete, connected transition graph or flower as a subgraph of the direct product of smaller flowers. The decomposition algorithm is related to a quadratic all-integer programming problem, which is discussed in detail. (Author)

Document Details

Document Type
Technical Report
Publication Date
Sep 01, 1965
Accession Number
AD0624577

Entities

People

  • C. M. Ablow
  • M. Yoeli

Organizations

  • SRI International

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Decomposition
  • Evolutionary Algorithms
  • Heuristic Methods
  • Integer Programming
  • Mathematics
  • Transitions

Readers

  • Graph Algorithms and Convex Optimization.
  • Operations Research