An efficient procedure for the generation of closed subsets

By William M. Waite

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

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

0 Comments

No entries found

Purchase the Article

An efficient procedure for the generation of closed subsets

The full text of this article is premium content

0 Comments

Forgot your password?

Need Access?

Join the ACM

Subscribe to Communications of the ACM Magazine