Accession Number : AD0624577

Title :   SUBDIRECT DECOMPOSITIONS OF TRANSITION GRAPHS,

Corporate Author : STANFORD RESEARCH INST MENLO PARK CALIF

Personal Author(s) : Yoeli,M. ; Ablow,C. M.

Report Date : 01 SEP 1965

Pagination or Media Count : 31

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)

Descriptors :   (*GRAPHICS, ALGEBRAIC TOPOLOGY), (*QUADRATIC PROGRAMMING, GRAPHICS), ALGORITHMS, MATRICES(MATHEMATICS), OPTIMIZATION

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE