Pages that link to "Item:Q1603407"

The following pages link to On generating \(k\)-ary trees in computer representation (Q1603407):

Displaying 12 items.

• Generating and enumerating digitally convex sets of trees (Q295254) (← links)
• Ranking and unranking of non-regular trees with a prescribed branching sequence (Q552163) (← links)
• The rotation graph of \(k\)-ary trees is Hamiltonian (Q975545) (← links)
• Generating binary trees by Glivenko classes on Tamari lattices (Q1007536) (← links)
• A loopless algorithm for generating binary tree sequences (Q1182098) (← links)
• The representation of permutations by trees (Q1339828) (← links)
• The coding of binary trees (Q1388063) (← links)
• Efficient loopless generation of Gray codes for \(k\)-ary trees. (Q1607068) (← links)
• Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← links)
• Generating Regular k-ary Trees Efficiently (Q4525952) (← links)
• (Q5013818) (← links)
• Generation matrix: an embeddable matrix representation for hierarchical trees (Q6057832) (← links)