A new algorithm for generation of permutations

DOI10.1007/BF01937486zbMath0542.68054OpenAlexW2063623490WikidataQ106202847 ScholiaQ106202847MaRDI QIDQ795511

Shmuel Zaks

Publication date: 1984

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

algorithm for generating permutations

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Discrete mathematics in relation to computer science (68R99)

Related Items (17)

Parallel generation of permutations and combinations ⋮ Greedy flipping of pancakes and burnt pancakes ⋮ Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes ⋮ Greedy cycles in the star graphs ⋮ Parallel permutation generation on linear array ⋮ Star transposition Gray codes for multiset permutations ⋮ Successor rules for flipping pancakes and burnt pancakes ⋮ Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality ⋮ Parallel algorithm for generating permutations on linear array ⋮ On generation of permutations through decomposition of symmetric groups into cosets ⋮ Lexicographic enumeration, ranking and unranking of permutations ofrout ofnobjects ⋮ Decomposing a star graph into disjoint cycles ⋮ Some problems on Cayley graphs ⋮ Efficient enumeration of cyclic permutations in situ ⋮ Syntactic view of sigma-tau generation of permutations ⋮ Parallel sorting on Cayley graphs ⋮ A Hamilton cycle in the \(k\)-sided pancake network

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds for sorting by prefix reversal
• A simplified loop-free algorithm for generating permutations
• Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
• Generation of Permutations by Adjacent Transposition

This page was built for publication: A new algorithm for generation of permutations