Minimal binary trees with a regular boundary: The case of skeletons with five endpoints

DOI10.1007/BF02361218zbMath0941.05018OpenAlexW2048950081MaRDI QIDQ1274069

A. A. Tuzhilin

Publication date: 11 January 1999

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02361218

zbMATH Keywords

Steiner problemskeletonsregular polygonsdiagonal triangulationslocally minimal binary treeslocally minimal planar networks

Mathematics Subject Classification ID

Trees (05C05)

Related Items (1)

Minimal Networks: A Review

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Steiner tree problem
• Solution of the Steiner problem for convex boundaries
• On the Problem of Steiner
• A.D. Alexandrov spaces with curvature bounded below
• Minimal binary trees with regular boundary: the case of sceletons with four ends
• Topologies of locally minimal planar binary trees
• Weighted minimal binary trees

This page was built for publication: Minimal binary trees with a regular boundary: The case of skeletons with five endpoints