A parallel derangement generation algorithm

DOI10.1007/BF01932701zbMath0679.68081OpenAlexW1996440939MaRDI QIDQ1822966

G. P. Bhattacharjee, P. Gupta

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01932701

zbMATH Keywords

parallel algorithmderangements

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

An optimal algorithm for generating equivalence relations on a linear array of processors ⋮ On generation of permutations through decomposition of symmetric groups into cosets ⋮ Listing combinatorial objects in parallel

Cites Work

• Parallel Generation of Permutations
• A new algorithm for generating derangements
• Unnamed Item
• Unnamed Item

This page was built for publication: A parallel derangement generation algorithm