A GRAPH DECOMPOSITION TECHNIQUE FOR STRUCTURING DATA.
COMPUTER COMMAND AND CONTROL CO WASHINGTON D C
Pagination or Media Count:
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
- Operations Research
- Computer Programming and Software
- Computer Hardware