The Fermat star of binary trees
From MaRDI portal
Publication:987825
DOI10.1016/j.ipl.2009.02.001zbMath1209.68379MaRDI QIDQ987825
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
binary tree; combinatorial problems; design of algorithms; Steiner tree; Fermat point; rotation distance; Fermat star
68R10: Graph theory (including graph drawing) in computer science
Cites Work
- Unnamed Item
- 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