The following pages link to Generating ordered trees (Q1102758):
Displaying 11 items.
- Efficient enumeration of ordered trees with \(k\) leaves (Q441889) (← links)
- Generating binary trees of bounded height (Q1064071) (← links)
- Generating t-ary trees in A-order (Q1104107) (← links)
- On generating B-trees with constant average delay and in lexicographic order (Q1313707) (← links)
- An efficient method of examining all trees (Q2785373) (← links)
- Efficient Chaining of Seeds in Ordered Trees (Q3000514) (← links)
- Uniform Generation of Rooted Ordered Trees with Prescribed Degrees (Q3140121) (← links)
- A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order (Q3789087) (← links)
- Loopless Generation of Trees with Specified Degrees (Q4551658) (← links)
- Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence (Q4943080) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710816) (← links)