Home → Magazine Archive → March 1967 (Vol. 10, No. 3) → An efficient procedure for the generation of closed... → Abstract

An efficient procedure for the generation of closed subsets

By William M. Waite

Communications of the ACM, Vol. 10 No. 3, Pages 169-171

An efficient algorithm is described for generating subsets of a set S which satisfy constraints of the form: “If si is a member of the subset, then sj must also be a member of the subset.” The algorithm has been programmed in the WISP language and successfully run on the IBM 7094 in connection with a routine to detect feedback in multidimensional iterative networks.

The full text of this article is premium content


No entries found