A class of full Steiner minimal trees

DOI10.1016/0012-365X(83)90179-6zbMath0508.05029OpenAlexW2071690036MaRDI QIDQ1837695

Yanyan Li

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90179-6

zbMATH Keywords

Steiner treelines of shortest possible length

Mathematics Subject Classification ID

Trees (05C05) Other designs, configurations (05B30)

Related Items (4)

Steiner minimal trees for regular polygons ⋮ A primer of the Euclidean Steiner problem ⋮ Steiner minimal trees for a class of zigzag lines ⋮ Steiner minimal trees for bar waves

Cites Work

• On the Problem of Steiner
• Steiner Trees for Ladders
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees

This page was built for publication: A class of full Steiner minimal trees