The parallel generation of combinations.
In this thesis we consider the problem of the generation of combinations of m elements chosen from a set of n elements. We provide a survey of the sequential and parallel algorithms for the generation of the (m,n)-combinations. The major achievement of this thesis is a parallel algorithm for generat...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
University of Ottawa (Canada)
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10393/10041 http://dx.doi.org/10.20381/ruor-8104 |