Pages that link to "Item:Q3081238"

The following pages link to Ranking and unranking algorithms for loopless generation of t-ary trees (Q3081238):

Displaying 9 items.

• Efficient loopless generation of Gray codes for \(k\)-ary trees. (Q1607068) (← links)
• Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees (Q1643905) (← links)
• Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← links)
• A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order (Q2037975) (← links)
• Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order (Q2082174) (← links)
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order (Q2321597) (← links)
• Two Algorithms for Unranking Arborescences (Q4876694) (← links)
• (Q5013818) (← links)
• Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order (Q5903738) (← links)