Weighted minimal binary trees

DOI10.1070/RM1995V050N03ABEH002569MaRDI QIDQ4884289zbMATH OpenOpenAlexFDO

Authors A. A. Tuzhilin, A. O. Ivanov

Publication date 29 September 1996

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/rm1995v050n03abeh002569

zbMATH Keywords

boundary setconvexity levelMelzak algorithmminimal networksSimson lineSteiner problemtwist numberweightweighted binary treesweighted minimal networks

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1166298
• Treelike families of multiweights
• w-Centroids and Least (w, l)-Central Subtrees in Weighted Trees
• Topologies of locally minimal planar binary trees
• Geometry and topology of local minimal 2-trees

Cited in

(8)

• Minimal binary trees with a regular boundary: The case of skeletons with five endpoints
• Treelike families of multiweights
• A plasticity principle of convex quadrilaterals on a convex surface of bounded specific curvature
• scientific article; zbMATH DE number 3881889 (Why is no real title available?)
• Weighted Leaf AVL-Trees
• scientific article; zbMATH DE number 1166298 (Why is no real title available?)
• Solving a generalized Gauss problem
• A Lagrangian program detecting the weighted Fermat-Steiner-Fréchet multitree for a Fréchet N-multisimplex in Euclidean N-space

This page was built for publication: Weighted minimal binary trees

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