AN OPTIMAL SYSTOLIC ALGORITHM FOR THE SET PARTITIONING PROBLEM

References

• Reingold , E. M. , Nievergelt , J. and Deo , N. , ( 1977 ). Combinatorial Algorithms: Theory and Practice , Chap. 5 , Prentice-Hall , Englewood Cliffs , NJ .
   Google Scholar
• Nijenhuis , A. and Wilf , H. S. , ( 1978 ). Combinatorial Algorithms , Academic , New York .
   Google Scholar
• Page , E. S. and Wilson , L. B. , ( 1979 ). An Introduction to Computational Combinatorics , ( Cambridge University Press , Cambridge , England ).
   Google Scholar
• Sedgewick , R. , ( 1977). Permutation Generation Methods, Computing Surreys , 19(2), 137–164.
   Google Scholar
• Akl , S. G. ( 1981 ). A Comparison of Combination Generation Methods , ACM Transactions on Mathematical Software , 7 ( 1 ), 42 – 45 .
   Web of Science ®Google Scholar
• Semba , I. ( 1984 ). An efficient algorithm for generating all k-subsets (1 ≤ k ≤ m ≤ n) of the set { 1. 2, …, n} in lexicographic order , Journal of Algorithms , 5 , 281 – 283 .
   Google Scholar
• Mor , M. and Fraenkel , A. S. , ( 1982 ). Permutation Generation on Vector Processors , The Computer Journal , 25 ( 4 ), 423 – 428 .
   Web of Science ®Google Scholar
• Akl , S. G. , ( 1987 ). Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations , The Computer Journal , 30 ( 5 ), 433 – 436 .
   Web of Science ®Google Scholar
• Chen , G. H. and Chern , M. S. , ( 1986 ). Parallel Generation of Permutations and Combinations , BIT , 26 ( 3 ), 277 – 283 .
   Web of Science ®Google Scholar
• Lin , C. J. , ( 1990 ). Parallel Generation of Permutations on Systolic Arrays , Parallel Computing , 15 , 267 – 276 .
   Web of Science ®Google Scholar
• Chan , B. and Akl , S. G. , ( 1986 ). Generating Combinations in Parallel, BIT , 26 , 277 – 283 .
   Google Scholar
• Lin , C. J. , ( 1989 ). A Parallel Algorithm for Generating Combination , Computers and Mathematics with Applications , 17 ( 12 ), 1523 – 1533 .
   Web of Science ®Google Scholar
• Djokic , B. , Miyakawa , M. , Sekguchi , S. , Semba , I. and Stojmenovic , I. , ( 1990 ). Parallel Algorithms for Generating Subsets and Sets Partitions , Algorithms: International Symposium SIGAL '90 , T. Asano et al. (Eds), ( Springer-Verlag ), pp. 76 – 85 .
   Google Scholar
• Moldovan , D. I. , ( 1983 ). On the Design of Algorithms for VLSI Systolic Arrays , Proc. IEEE 71 ( 1 ), 113 – 120 .
   Google Scholar
• Kung , S. Y. , ( 1988 ). VLSI Array Processor , Prentice-Hall .
   Google Scholar
• Akl , S. G. , ( 1980 ). A New Algorithm for Generating Derangements, BIT , 20 ( 1 ), 2 – 7 .
   Google Scholar
• Rotem , D. and Varol , Y. L. , ( 1978 ). Generating of Binary Trees from Ballot Sequences , Journal of ACM , 25 ( 3 ), 396 – 404 .
   Web of Science ®Google Scholar
• Er , M. C. , ( 1985 ). Enumerating Ordered Trees Lexicographically , The Computer Journal , 28 ( 5 ), 538 – 542 .
   Web of Science ®Google Scholar
• Er , M. C. , ( 1983 ). A Note on Generating Well-formed Parenthesis Strings Lexicographically , The Computer Journal , 26 ( 3 ), 205 – 207 .
   Web of Science ®Google Scholar