Associative Processing of Network Flow Problems.
Abstract
Application of the associative processor to the solution of the network flow problem is investigated. The specific class of problems examined is the maximal flow problem. The results of this research support the conclusion that: a best sequential algorithm may not be a good associative algorithm, while a bad sequential algorithm can be the best associative algorithm; the performance of an associative processor will be greatly improved if a data manipulator is added to the processor.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1976
- Accession Number
- ADA024380
Entities
People
- I-ngo Chen
- Tse-yun Feng
- Yu-kuo Chen
Organizations
- Syracuse University