Pages that link to "Item:Q3805926"
From MaRDI portal
The following pages link to Generating trees with<i>n</i>nodes and<i>m</i>leaves (Q3805926):
Displaying 10 items.
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- On generating B-trees with constant average delay and in lexicographic order (Q1313707) (← 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)
- Parallel generation of í-ary trees with ballot-sequences (Q3410896) (← links)
- A new algorithm for generation of different types of RNA (Q3568449) (← links)
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) (Q3605493) (← links)
- Ranking and unranking<i>k</i>-ary trees with a 4<i>k –</i>4 letter alphabet (Q4366347) (← links)
- Generation of<i>t</i>-ary trees with Ballot-sequences<sup>*</sup> (Q4462115) (← links)
- (Q5013818) (← links)