An efficient procedure for the generation of closed subsets

Authors:
William M. Waite
Affiliations:
Univ. of Sydney, Sydney, Australia
Venue:
Communications of the ACM
Year:
1967

Citing 2
Cited 2

Path Detection in Multidimensional Iterative Arrays

Journal of the ACM (JACM)
Lists and why they are useful

ACM '64 Proceedings of the 1964 19th ACM national conference

A system for network picture processing with interactive computer graphics

ACM '69 Proceedings of the 1969 24th national conference
A graph manipulator for on-line network picture processing

AFIPS '69 (Fall) Proceedings of the November 18-20, 1969, fall joint computer conference

Quantified Score

Hi-index	48.22

Visualization

Abstract

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.