The Fermat star of binary trees

DOI10.1016/j.ipl.2009.02.001zbMath1209.68379OpenAlexW2075931019MaRDI QIDQ987825

Linda Pagli, Fabrizio Luccio

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.02.001

zbMATH Keywords

binary treecombinatorial problemsdesign of algorithmsSteiner treeFermat pointrotation distanceFermat star

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Efficient lower and upper bounds of the diagonal-flip distance between triangulations
• Steiner tree problems
• The Steiner tree problem
• An efficient upper bound of the rotation distance of binary trees
• On the upper bound on the rotation distance of binary trees
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Unnamed Item

This page was built for publication: The Fermat star of binary trees