| Autor: |
Wyrzykowski, Roman, Dongarra, Jack, Meyer, Norbert, Waśniewski, Jerzy, Kokosiński, Zbigniew |
| Zdroj: |
Parallel Processing & Applied Mathematics; 2006, p67-74, 8p |
| Abstrakt: |
In this paper a new parallel algorithm is presented for generation of all exactly m-block partitions of n-element set. The basic building blocks of the algorithm are an associative generator of combinations and a complex parallel counter. Consecutive objects are generated in lexicographic order, with O(1) time per object. The algorithm can be used for generation of all partitions within the given range of the parameter m, where 1 ≤ m1 ≤ m ≤ m2 ≤ n. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
