๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Parallel generation of permutations and combinations

โœ Scribed by G. H. Chen; Maw-Sheng Chern

Publisher
Springer Netherlands
Year
1986
Tongue
English
Weight
304 KB
Volume
26
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

New Methods for the Generation of Permut
New Methods for the Generation of Permutations, Combinations, and Other Combinatorial Objects in Parallel
โœ Adam Kapralski ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 926 KB

In this paper, three methods for generating sets of combinatorial objects in parallel are developed. The first one is generation of the next choice function satisfying a requirement \(W\) of a given indexed family. Then it is shown that permutations and combinations can be represented by these choic

q-Permutations and q-combinations
q-Permutations and q-combinations
โœ Won -Sang Chung; Hye -Jung Kang ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Springer ๐ŸŒ English โš– 208 KB
Generating combinations in parallel
Generating combinations in parallel
โœ Becky Chan; Selim G. Akl ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 300 KB
Representation of permutations, combinat
Representation of permutations, combinations and dihedral elements as trees
โœ B.J. Arnow ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 162 KB

Permutations and combinations of n objects as well as the elements of the dihedral group of order 2n (i.e. flips and rotation of an n-gun) are represented as nodes of trees. The algorithms for generating the nodes and traversing the trees are illustrated using flowcharts and specific walk-throughs f