Rotation distance for rank bounded trees

DOI10.1007/978-3-031-22105-7_47arXiv2304.03985MaRDI QIDQ6168976

S. K. M. Anoop, M. N. Jayalal Sarma

Publication date: 10 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2304.03985

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• On the rotation distance between binary trees
• Rotation distance is fixed-parameter tractable
• A note on some tree similarity measures
• Learning decision trees from random examples
• The diameter of associahedra
• A Linear-Time Approximation Algorithm for Rotation Distance
• The rotation graph of binary trees is Hamiltonian
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs

This page was built for publication: Rotation distance for rank bounded trees