Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel genetic algorithm (PGA) can beâ€¦ (More)

In this paper two new parallel algorithms are presented for generation of (n,k)-combinations. Computations run in associative processor models. Objects are generated in lexicographic order, with O(1)â€¦ (More)

A hardware-oriented algorithm for generating permutations is presented that takes as a theoretic base an iterative decomposition of the symmetric group Sn into cosets. It generates permutations in aâ€¦ (More)

In this paper a new parallel genetic algorithm for coloring graph vertices is presented. In the algorithm we apply a migration model of parallelism and de ne two new recombination operators: SPPX andâ€¦ (More)

In this paper a new parallel genetic algorithm for coloring graph vertices is presented. In the algorithm we apply a migration model of parallelism and define two new recombination operators SPPX andâ€¦ (More)

In this paper parallel algorithms are presented for enumeration and unranking of tâ€“ary trees with n internal nodes. Generation algorithms are designed in the associative computing model ASC thatâ€¦ (More)

In this paper a new parallel algorithm is presented for generation of tâ€“ary trees. Computations run in an associative processor model. Tree sequences are generated in lexicographic order, with O(1)â€¦ (More)

In this paper an O(n) parallel algorithm is presented for fast unranking tâ€“ary trees with n internal nodes in Zaksâ€™ representation. A sequential O(nt) algorithm is derived on the basis of dynamicâ€¦ (More)