Pages that link to "Item:Q655198"
From MaRDI portal
The following pages link to Loop-free Gray code algorithms for the set of compositions (Q655198):
Displaying 11 items.
- Generalized algorithm for restricted weak composition generation (Q387319) (← links)
- Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions (Q500971) (← links)
- A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
- Gray codes, loopless algorithm and partitions (Q1040787) (← links)
- A Gray code for set partitions (Q1239129) (← links)
- Loopless generation of Gray codes for \(k\)-ary trees (Q1606919) (← links)
- Loopless Gray code enumeration and the Tower of Bucharest (Q1623270) (← links)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← links)
- Combinatorial families that are exponentially far from being listable in Gray code sequence (Q4216327) (← links)
- (Q4504909) (← links)
- A loopless implementation of a gray code for signed permutations (Q4899855) (← links)