The Fermat star of binary trees

DOI10.1016/J.IPL.2009.02.001MaRDI QIDQ987825zbMATH OpenOpenAlexFDO

Authors Fabrizio Luccio, L. Pagli

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 algorithmsFermat pointFermat starrotation distanceSteiner tree

Mathematics Subject Classification ID

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

Recommendations

• Average Fermat distance of a self-similar fractal tree
• scientific article; zbMATH DE number 1161281
• AVERAGE FERMAT DISTANCES ON VICSEK NETWORKS
• AVERAGE FERMAT DISTANCE OF A FRACTAL TREE
• Rotation Distance, Triangulations, and Hyperbolic Geometry

Cites work

• An efficient upper bound of the rotation distance of binary trees
• Efficient lower and upper bounds of the diagonal-flip distance between triangulations
• scientific article; zbMATH DE number 1439421 (Why is no real title available?)
• On the upper bound on the rotation distance of binary trees
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Steiner tree problems
• The Steiner tree problem

Cited in

(1)

• Average Fermat distance of a self-similar fractal tree

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q987825)