AN OPTIMAL SYSTOLIC ALGORITHM FOR THE SET PARTITIONING PROBLEM
WEI-PING LEE, Jong-Chuang Tsay, Hsien-Sheng Chen, TAI-JYI TSENG · International Journal of Parallel Emergent and Distributed Systems · 1997
Generating set partitions is frequently necessary in combinatorial algorithms. In this paper, we shall utilize Moldovan's space-time mapping methodology to design a systolic algorithm for the set partitioning problem. The algorithm is cost-optimal design and can generate all set partitions in lexicographic order. Since it can be run on a linear systolic array, it is very amenable to VLSI implementation.