Generating binary trees using rotations
From MaRDI portal
Recommendations
Cited in
(27)- Generating binary trees of bounded height
- Generating ordered trees
- A loopless algorithm for generating binary tree sequences
- Loopless generation of \(k\)-ary tree sequences
- On generating \(k\)-ary trees in computer representation
- Efficient loopless generation of Gray codes for \(k\)-ary trees.
- Generating random binary trees -- a survey
- A constant-time algorithm for middle levels Gray codes
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- Generating strictly binary trees at random based on convex polygon triangulations
- On the loopless generation of binary tree sequences
- A New Algorithm for Generating Binary Trees using Rotations
- scientific article; zbMATH DE number 4055654 (Why is no real title available?)
- scientific article; zbMATH DE number 4062616 (Why is no real title available?)
- Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions
- On Rotations and the Generation of Binary Trees
- scientific article; zbMATH DE number 1156647 (Why is no real title available?)
- Loop Free Generation ofK-Ary Trees
- Ranking trees generated by rotations
- Ranking and unranking of non-regular trees with a prescribed branching sequence
- Left distance binary tree representations
- The rotation -lattice of ternary trees
- Parallel algorithms for generating combinatorial objects on linear processor arrays with reconfigurable bus systems.
- Visualizing Lucas's Hamiltonian paths through the associahedron 1-skeleton (media exposition)
- Simple random sampling of binary forests with fixed number of nodes and trees
- Simple random sampling of binary forests with fixed number of nodes and trees
- An improved kernel size for rotation distance in binary trees
This page was built for publication: Generating binary trees using rotations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768417)
