Accession Number : AD0658756
Title : A GRAPH DECOMPOSITION TECHNIQUE FOR STRUCTURING DATA.
Descriptive Note : Final rept.,
Corporate Author : COMPUTER COMMAND AND CONTROL CO WASHINGTON D C
Personal Author(s) : Jensen,Paul A.
Report Date : 01 SEP 1967
Pagination or Media Count : 78
Abstract : For a number of advanced computer applications it will be necessary to store large quantities of data concerning relationships between a procedure for structuring transitive noncommutative relational data in a series of acyclical graphs which permit rapid access to the information. It is primarily concerned with providing algorithms which determine data structures which minimize the expected search time to discover the truth of the relation between an arbitrary pair of items. To provide computationally feasible techniques, it is necessary to temper the goal of optimality somewhat, using heuristic justification to greatly reduce the set of feasible structures. The resultant techniques utilize a max-flow min-cut algorithm and dynamic programming. (Author)
Descriptors : (*DATA STORAGE SYSTEMS, *OPERATIONS RESEARCH), GRAPHICS, THEORY, ALGORITHMS, MINIMAX TECHNIQUE, OPTIMIZATION, DYNAMIC PROGRAMMING, COMPUTER LOGIC, COMPUTER PROGRAMMING
Subject Categories : Operations Research
Computer Programming and Software
Distribution Statement : APPROVED FOR PUBLIC RELEASE