Pages that link to "Item:Q1606919"

The following pages link to Loopless generation of Gray codes for \(k\)-ary trees (Q1606919):

Displaying 17 items.

• Shifts and loopless generation of \(k\)-ary trees (Q293252) (← links)
• On the loopless generation of binary tree sequences (Q293424) (← links)
• A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) (← links)
• Loop-free Gray code algorithms for the set of compositions (Q655198) (← links)
• A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words (Q866549) (← links)
• The rotation graph of \(k\)-ary trees is Hamiltonian (Q975545) (← links)
• A general exhaustive generation algorithm for Gray structures (Q995753) (← links)
• Generating binary trees by Glivenko classes on Tamari lattices (Q1007536) (← links)
• On generating \(k\)-ary trees in computer representation (Q1603407) (← links)
• Efficient loopless generation of Gray codes for \(k\)-ary trees. (Q1607068) (← links)
• A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order (Q2037975) (← links)
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order (Q2321597) (← links)
• A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously (Q2867132) (← links)
• Ranking and unranking algorithms for loopless generation of t-ary trees (Q3081238) (← links)
• Generation of<i>t</i>-ary trees with Ballot-sequences^* (Q4462115) (← links)
• A loopless implementation of a gray code for signed permutations (Q4899855) (← links)
• (Q5013818) (← links)