A new algorithm for generation of permutations
From MaRDI portal
Recommendations
Cites work
- A simplified loop-free algorithm for generating permutations
- Bounds for sorting by prefix reversal
- Generation of Permutations by Adjacent Transposition
- scientific article; zbMATH DE number 3559489 (Why is no real title available?)
- scientific article; zbMATH DE number 3557795 (Why is no real title available?)
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
Cited in
(43)- Parallel generation of permutations and combinations
- Computing permutation encodings
- Decomposing a star graph into disjoint cycles
- Generating permutations with given ups and downs
- Alternative developments of cyclic-permutation algorithms
- Generating permutations of a bag by interchanges
- Greedy cycles in the star graphs
- A permutation-generating algorithm
- A loopless algorithm for generating the permutations of a multiset
- A Hamilton cycle in the \(k\)-sided pancake network
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality
- Integrated strategy for generating permutation
- A multi-stack method for the fast generation of permutations with minimal length increasing subsequences
- Greedy flipping of pancakes and burnt pancakes
- scientific article; zbMATH DE number 5855074 (Why is no real title available?)
- Parallel permutation generation on linear array
- Generation of Permutations Following Lehmer and Howell
- scientific article; zbMATH DE number 4199437 (Why is no real title available?)
- Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes
- New algorithm for listing all permutations
- Lexicographic enumeration, ranking and unranking of permutations ofrout ofnobjects
- Efficient enumeration of cyclic permutations in situ
- scientific article; zbMATH DE number 3557795 (Why is no real title available?)
- scientific article; zbMATH DE number 1257265 (Why is no real title available?)
- scientific article; zbMATH DE number 1156604 (Why is no real title available?)
- scientific article; zbMATH DE number 1522933 (Why is no real title available?)
- scientific article; zbMATH DE number 871160 (Why is no real title available?)
- Notice of Removal: A Novel Representation for Permutations
- Permutations of \(\mathbb{N}\) generated by left-right filling algorithms
- Parallel Processing and Applied Mathematics
- scientific article; zbMATH DE number 2216957 (Why is no real title available?)
- Generating alternating permutations lexicographically
- Syntactic view of sigma-tau generation of permutations
- Star transposition Gray codes for multiset permutations
- Kneser graphs are Hamiltonian
- Generating signed permutations by twisting two-sided ribbons
- Traversing combinatorial 0/1-polytopes via optimization
- Kneser graphs are Hamiltonian
- Parallel sorting on Cayley graphs
- Successor rules for flipping pancakes and burnt pancakes
- Parallel algorithm for generating permutations on linear array
- On generation of permutations through decomposition of symmetric groups into cosets
- Some problems on Cayley graphs
This page was built for publication: A new algorithm for generation of permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795511)
