DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
AD0656608
Title:
AN IMPROVED METHOD OF FINDING ALL LARGEST COMBINABLE CLASSES,
Corporate Author:
ILLINOIS UNIV URBANA COORDINATED SCIENCE LAB
Report Date:
1967-08-01
Abstract:
Several algorithms, such as a row-column minimization algorithm and an asynchronous machine assignment algorithm, require finding the largest sets of combinable elements from a list of pairwise combinable elements. The paper presents a technique for finding these sets which is generally faster than the one presently in use. Further, the presentation of this technique uncovers an interesting theory about combinability.
Pages:
0028
Contract Number:
DA-28-043-AMC-00073(E)
File Size:
0.00MB
