On Rotations and the Generation of Binary Trees
From MaRDI portal
Recommendations
Cited in
(57)- Generating binary trees by Glivenko classes on Tamari lattices
- Generating permutations of a bag by interchanges
- 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.
- Gray code enumeration of families of integer partitions
- Generating random binary trees -- a survey
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions
- Combinatorial generation via permutation languages. II. Lattice congruences
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- 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
- A direct algorithm for restricted rotation distance
- Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees
- A generic approach for the unranking of labeled combinatorial classes
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- Shifts and loopless generation of \(k\)-ary trees
- On the loopless generation of binary tree sequences
- An Eades-McKay algorithm for well-formed parentheses strings
- The Mathematics of Ferran Hurtado: A Brief Survey
- Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- A New Algorithm for Generating Binary Trees using Rotations
- scientific article; zbMATH DE number 5130543 (Why is no real title available?)
- On generating all binary trees
- Efficient Computation of Middle Levels Gray Codes
- Generating binary trees by transpositions
- Generating binary trees using rotations
- The rotation graph of binary trees is Hamiltonian
- scientific article; zbMATH DE number 4055654 (Why is no real title available?)
- scientific article; zbMATH DE number 4062616 (Why is no real title available?)
- Short notes: Some Properties of the Rotation Lattice of Binary Trees
- scientific article; zbMATH DE number 58304 (Why is no real title available?)
- A metric for rooted trees with unlabeled vertices based on nested parentheses
- On the generation of binary trees inA-order
- On the generation of binary trees from (0–1) codes
- Twist–Rotation Transformations of Binary Trees and Arithmetic Expressions
- Loopless Algorithms And SchrÖder Trees
- A constant amortized time algorithm for generating left-child sequences in lexicographic order
- Loop Free Generation ofK-Ary Trees
- Generation, ranking and unranking of ordered trees with degree bounds
- An efficient algorithm for estimating rotation distance between two binary trees
- Combinatorial generation via permutation languages. I: Fundamentals
- Optimal binary search trees
- On flips in planar matchings
- Combinatorial Generation via Permutation Languages. V. Acyclic Orientations
- The rotation distance of brooms
- Traversing combinatorial 0/1-polytopes via optimization
- Combinatorial generation via permutation languages. VI: Binary trees
- A Gray code of ordered trees
- Flips in colorful triangulations
- Pattern-avoiding binary trees -- generation, counting, and bijections
- Combinatorial generation via permutation languages. IV: Elimination trees
- Combinatorial generation via permutation languages. VII: Supersolvable hyperplane arrangements
- Skipping ropes: an efficient gray code algorithm for generating wiggly permutations
- An improved kernel size for rotation distance in binary trees
- On the rotation distance between binary trees
This page was built for publication: On Rotations and the Generation of Binary Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4275333)
