Pages that link to "Item:Q1885026"
From MaRDI portal
The following pages link to A loopless algorithm for generating the permutations of a multiset (Q1885026):
Displayed 15 items.
- Binary bubble languages and cool-lex order (Q645969) (← links)
- Loop-free Gray code algorithms for the set of compositions (Q655198) (← links)
- Gray codes for signed involutions (Q724881) (← links)
- Generating Gray codes for weak orders in constant amortized time (Q785788) (← links)
- A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (Q866549) (← links)
- Gray code for permutations with a fixed number of cycles (Q879329) (← links)
- Combinatorial Gray codes for classes of pattern avoiding permutations (Q924132) (← links)
- More restrictive Gray codes for some classes of pattern avoiding permutations (Q989488) (← links)
- Gray codes, loopless algorithm and partitions (Q1040787) (← links)
- The coolest way to generate combinations (Q1044892) (← links)
- Gray code for derangements (Q1827847) (← links)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
- FUSING LOOPLESS ALGORITHMS FOR COMBINATORIAL GENERATION (Q3434277) (← links)
- Hamiltonian paths for involutions in the square of a Cayley graph (Q5446252) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)