Minimal steiner trees on square lattices
The paper gives a general approach in constructing minimal trees using Steiner points. Steiner points are the points added in a given set of points, used to minimize the length of the network connecting the original set of points. Such a network is called a Steiner tree. A square lattice is a set of...
Saved in:
Main Authors: | Santiago, Monique S., Ventura, Rachel P. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1992
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/16028 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Smallest regular graphs with irregular squares
by: Alba, Alvin P., et al.
Published: (1992) -
On biconnected graphs
by: Gonzaga, Alex C.
Published: (1995) -
Chip firing games on the n-cycles and tree graphs
by: Ching, Mike Lester L.
Published: (1998) -
An investigation of fibonacci trees
by: Her, Hye Yoon
Published: (1993) -
Spanning tree algorithms
by: Chan, Cecille Elinor S., et al.
Published: (1997)