|
Deep Blue at the University of Michigan >
All Collections >
Mathematical Geography, Institute of (IMaGe) >
|
Please use this persistent URL to cite or link to this item:
|
| Title: | An Atlas of Steiner Networks |
| Authors: | Arlinghaus, Sandra Lach
Arlinghaus, S. L. |
| Keywords: | Steiner networks
shortest paths |
| Issue Date: | 1989 |
| Publisher: | Institute of Mathematical Geography |
| Citation: | Arlinghaus, Sandra Lach. An Atlas of Steiner Networks. Ann Arbor: Institute of Mathematical Geography, Monograph Series, Monograph #9, 1989. 89 pages. http://hdl.handle.net/2027.42/58268 |
| Series/Report no.: | Institute of Mathematical Geography (IMaGe) Monograph Series.
Monograph #9. |
| Abstract: | Table of Contents: Introduction | Networks of Minimal Total Length in the Triangle | Networks of Minimal Total Length, in General | Geometric Constructions: the Six Point Case | Enumeration of Candidate Steiner Networks |
| Description: | A Steiner network is a tree of minimum total length joining a prescribed, finite, number of locations; often new locations are introduced into the prescribed set to determine the minimum tree. This Atlas explains the mathematical detail behind the Seiner construction for prescribed sets of n locations and displays the steps, visually, in a series of Figures. The proof of the STeiner construction is by mathematical induction, and enough steps in the early part of the induction are displayed, completely that the reader who is well-trained in Euclidean geometry, and familiar with concepts from graph theory and elementary number theory,, should be able to replicate the constructions for full as well as for degenerate Steiner trees. |
| URI: | http://hdl.handle.net/2027.42/58268 |
| ISBN: | 1-877751-18-9 |
| Appears in Collections: | Mathematical Geography, Institute of (IMaGe)
Interdisciplinary and Peer-Reviewed
|
Files in This Item:
| File |
Description |
Size | Format | |
|---|
| Mongraph09.pdf | | 15039Kb | Adobe PDF | View/Open |
|
Deep Blue encourages the fair use of copyrighted material, and you are free to link to content here without asking for permission. Consult the document(s) and/or contact the copyright holder for additional rights questions and requests.
|
