On the Number of Minimal 1-Steiner Trees.
B. Aronov, D. Eppstein, M. Bern (1994)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Analytic Formulas for Full Steiner Trees.”
On the Number of Minimal 1-Steiner Trees.
Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.
M. Yvinec (1992)
Discrete & computational geometry
Similarity:
Steiner Minimal Trees on Sets of Four Points.
D.Z. Du, F.K. Hwang, G.D. Song, G.Y Ting (1987)
Discrete & computational geometry
Similarity:
A Décomposition Theorem on Euclidean Steiner Minimal Trees.
D.Z. Du, F.K. Hwang, G.D. Song, G.Y Ting (1988)
Discrete & computational geometry
Similarity:
Direction Trees.
R.E. Jamison (1987)
Discrete & computational geometry
Similarity:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
H. Edelsbrunner, E. Welzl, P.K. Agarwal, O. Schwarzkopf (1991)
Discrete & computational geometry
Similarity:
Transitions in Geometric Minimum Spanning Trees.
R. Kenyon, C. Kenyon (1992)
Discrete & computational geometry
Similarity:
On Minimum and Maximum Spanning Trees of Linearly Moving Points.
T. Tokuyama, N. Katoh, K. Iwano (1995)
Discrete & computational geometry
Similarity:
On A-Trees
Đuro Kurepa (1968)
Publications de l'Institut Mathématique
Similarity:
Low-Degree Minimum Spanning Trees.
G. Robins, J.S. Salowe (1995)
Discrete & computational geometry
Similarity:
On some hypotheses concerning trees.
D. Kurepa (1977)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity: