A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems

DOI10.1080/02522667.1988.10698905zbMath0647.68072OpenAlexW2008781487MaRDI QIDQ3792260

M. C. Er

Publication date: 1988

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1988.10698905

zbMATH Keywords

parallel algorithmtime complexitypermutation generatoralgorithm adaptivecost optimal algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Discrete mathematics in relation to computer science (68R99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (2)

On generation of permutations of \(m\) out of \(n\) items ⋮ On random and adaptive parallel generation of combinatorial objects

Cites Work

• Unnamed Item
• Unnamed Item
• Generating combinations in parallel
• Parallel generation of permutations and combinations
• Permuting data with the Omega network
• Parallel Generation of Permutations
• Lexicographic ordering, ranking and unranking of combinations
• Generation, Ranking and Unranking of Permutations based on the Mixed-Radix Codes
• Parallel permutation and sorting algorithms and a new generalized connection network
• Array Permutation by Index-Digit Permutation

This page was built for publication: A Parallel Algorithm for Cost-Optimal Generation of Permutations ofrout ofnItems