Name
Abstract | ||
|---|---|---|
A Steiner minimal tree for a given set of points in the plane is a tree which interconnects these points using lines of shortest possible total length. We construct an infinite class of trees which are the unique full Steiner minimal trees for their sets of endpoints (vertices of degree one). |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1016/0012-365X(83)90179-6 | Discrete Mathematics |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Vertex (geometry),Steiner tree problem,Mathematics | Journal | 45 |
Issue | ISSN | Citations |
1 | Discrete Mathematics | 3 |
PageRank | References | Authors |
1.35 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| F.K Hwang | 1 | 48 | 18.86 |
| Jia Feng Weng | 2 | 3 | 2.03 |
| Ding Zhu Du | 3 | 5 | 2.07 |