The following pages link to Generating t-ary trees in A-order (Q1104107):
Displaying 20 items.
- Shifts and loopless generation of \(k\)-ary trees (Q293252) (← links)
- Ranking and unranking of non-regular trees with a prescribed branching sequence (Q552163) (← links)
- Staircase tilings and \(k\)-Catalan structures (Q998328) (← links)
- Generating binary trees of bounded height (Q1064071) (← links)
- Generating ordered trees (Q1102758) (← links)
- A loopless algorithm for generating binary tree sequences (Q1182098) (← links)
- Generating permutations with given ups and downs (Q1186163) (← links)
- On generating B-trees with constant average delay and in lexicographic order (Q1313707) (← links)
- Loopless generation of \(k\)-ary tree sequences (Q1339380) (← links)
- Cool-lex order and \(k\)-ary Catalan structures (Q1932373) (← 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)
- Ranking and unranking algorithms for loopless generation of t-ary trees (Q3081238) (← links)
- Parallel generation of í-ary trees with ballot-sequences (Q3410896) (← links)
- A new algorithm for generation of different types of RNA (Q3568449) (← links)
- Generating binary trees in A-order from codewords defined on a four-letter alphabet (Q4321109) (← links)
- Ranking and unranking<i>k</i>-ary trees with a 4<i>k –</i>4 letter alphabet (Q4366347) (← links)
- A-order generation of k-ary trees with a 4k–4 letter alphabet (Q4718611) (← links)
- Loop Free Generation of<i>K</i>-Ary Trees (Q4811716) (← links)
- Parallel Processing and Applied Mathematics (Q5307360) (← links)
