The paper proves that a parallel metaheuristic like the parallel genetic algorithm (PGA) can be efficiently used for computing approximate sum colorings and finding upper bounds for chromatic sums and chromatic sum numbers for hard---to---color graphs.Expand

This paper presents a hardware implementation of a generator of combinations based on parallel algorithm Bincombgen that generates, in binary representation, all combinations in reverse lexicographic order in constant time per combination.Expand

The concept of a partial derangement is introduced and a versatile representation of partial Derangements is proposed with permutations and derangements as special cases.Expand

A hardware-oriented algorithm for generating permutations is presented that takes as a theoretic base an iterative decomposition of the symmetric group S~ into cosets.Expand