Adaptive and Optimal Parallel Algorithms for Enumerating Permutations and Combinations

DOI10.1093/COMJNL/30.5.433MaRDI QIDQ3771644zbMATH OpenOpenAlexFDO

Authors 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

combinationsparallel algorithmspermutations

Mathematics Subject Classification ID

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

Cited in

(8)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771644)