Ranking trees generated by rotations
From MaRDI portal
Publication:5056098
DOI10.1007/3-540-52846-6_84zbMath1502.68084OpenAlexW1517750266MaRDI QIDQ5056098
Publication date: 9 December 2022
Published in: SWAT 90 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-52846-6_84
Cites Work
- Binary tree gray codes
- Generating binary trees using rotations
- The rotation graph of binary trees is Hamiltonian
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- A numbering system for binary trees
- Generation of Binary Trees from Ballot Sequences
- Unnamed Item
- Unnamed Item