Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations

DOI10.1093/comjnl/30.5.433zbMath0633.68066OpenAlexW2156033088MaRDI QIDQ3771644

Selim G. Akl

Publication date: 1987

Published in: The Computer Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/comjnl/30.5.433

zbMATH Keywords

permutationsparallel algorithmscombinations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Theory of operating systems (68N25) Discrete mathematics in relation to computer science (68R99)

Related Items (8)

Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges ⋮ On random and adaptive parallel generation of combinatorial objects ⋮ Parallel permutation generation on linear array ⋮ An optimal algorithm for generating equivalence relations on a linear array of processors ⋮ Parallel algorithm for generating permutations on linear array ⋮ A simple systolic algorithm for generating combinations in lexicographic order ⋮ An optimal parallel algorithm for generating combinations ⋮ Generating subsets on a systolic array

This page was built for publication: Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations