A simplified loop-free algorithm for generating permutations

DOI10.1007/BF01932689zbMATH Open0317.05006WikidataQ29396484 ScholiaQ29396484MaRDI QIDQ4078041FDOQ4078041

Authors Nachum Dershowitz

Publication date 1975

Published in BIT (Search for Journal in Brave)

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Orthogonal arrays, Latin squares, Room squares (05B15) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites work

• Generation of Permutations by Adjacent Transposition
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations

Cited in

(4)

• A new algorithm for generation of permutations
• Gray codes for reflection groups
• A constant-time algorithm for middle levels Gray codes
• Generating permutations with given ups and downs

This page was built for publication: A simplified loop-free algorithm for generating permutations

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