AN IMPROVED METHOD OF FINDING ALL LARGEST COMBINABLE CLASSES,

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.

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1967
Accession Number
AD0656608

Entities

People

  • Gerald J. Lipovski

Organizations

  • University of Illinois Urbana–Champaign

Tags

DTIC Thesaurus Topics

  • Algorithms

Fields of Study

  • Computer science

Readers

  • Parallel and Distributed Computing.
  • Regression Analysis.
  • Systems Analysis and Design