Generating ordered trees
From MaRDI portal
Recommendations
- Generating t-ary trees in A-order
- scientific article; zbMATH DE number 3961006
- Enumerating Ordered Trees Lexicographically
- Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
- Lexicographically ordered trees
- Generating trees and proper Riordan arrays
- scientific article; zbMATH DE number 1456949
- The generation of random, binary unordered trees
- Ordered trees and the inorder traversal
Cites work
Cited in
(19)- On enumerating tree permutations in natural order
- Generating binary trees of bounded height
- scientific article; zbMATH DE number 3864523 (Why is no real title available?)
- Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
- Graph-Theoretic Concepts in Computer Science
- Generation and enumeration of all solutions of the characteristic sum condition
- A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order
- scientific article; zbMATH DE number 4031714 (Why is no real title available?)
- scientific article; zbMATH DE number 3961006 (Why is no real title available?)
- On generating B-trees with constant average delay and in lexicographic order
- Efficient enumeration of ordered trees with \(k\) leaves
- Generating t-ary trees in A-order
- On generating all binary trees
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
- Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
- Efficient Chaining of Seeds in Ordered Trees
- scientific article; zbMATH DE number 3935065 (Why is no real title available?)
- Generating binary trees using rotations
- Loopless Generation of Trees with Specified Degrees
This page was built for publication: Generating ordered trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1102758)