Pages that link to "Item:Q795511"
From MaRDI portal
The following pages link to A new algorithm for generation of permutations (Q795511):
Displaying 17 items.
- Greedy flipping of pancakes and burnt pancakes (Q299051) (← links)
- Independent even cycles in the pancake graph and greedy prefix-reversal Gray codes (Q343754) (← links)
- Parallel sorting on Cayley graphs (Q807014) (← links)
- Successor rules for flipping pancakes and burnt pancakes (Q897860) (← links)
- Parallel algorithm for generating permutations on linear array (Q918208) (← links)
- On generation of permutations through decomposition of symmetric groups into cosets (Q922698) (← links)
- Some problems on Cayley graphs (Q952069) (← links)
- Parallel generation of permutations and combinations (Q1085616) (← links)
- Decomposing a star graph into disjoint cycles (Q1182082) (← links)
- Greedy cycles in the star graphs (Q1669899) (← links)
- A Hamilton cycle in the \(k\)-sided pancake network (Q2115848) (← links)
- Hamiltonicity of \(k\)-sided pancake networks with fixed-spin: efficient generation, ranking, and optimality (Q2689255) (← links)
- Parallel permutation generation on linear array (Q3210895) (← links)
- Lexicographic enumeration, ranking and unranking of permutations of<i>r</i>out of<i>n</i>objects (Q3804212) (← links)
- Efficient enumeration of cyclic permutations in situ (Q3826556) (← links)
- Syntactic view of sigma-tau generation of permutations (Q5918363) (← links)
- Star transposition Gray codes for multiset permutations (Q6074576) (← links)
