| |
1
|
BoYcs, W.M., AND SEERY, J.B. STEINER 72, an improved version of Coekayne and Schiller's program STEINER for the minimal network problem. Comptng. Sci. Tech. Rep. No. 35, Comptng. Sci. Res. Ctr., Bell Laboratories, Murray Hill, N.J.
|
| |
2
|
CHUNG, F.R.K., AND GRAhAm, R.L. Steiner trees for ladders. Annals of Discrete Math.--Proc. Qualicum Beach Conf. To appear.
|
| |
3
|
COCKAYNE, E J. Computation of minimal length full Steiner trees on the vertices of a convex polygon. Math. Comput. P8 (1969), 521-531
|
| |
4
|
COCKAYNE, E.J. On the efficiency of the algorithm for Steiner minimal trees. SIAM J. Appl. Math. 18 (1970), 150-159.
|
| |
5
|
COCKAYNE, E.J. On the Steiner problem. Canad. Math. Bull. 10 (1967), 431-450.
|
| |
6
|
COCKAYNE, E J., AND SCHILLER, D.G. Computation of Steiner minimal trees. In Combinatorics, D.J A. Welsh and D.R. Woodall, Eds., Inst. Math. Appl., 1972, pp. 53-71 (FOR- TRAN IV program available on request from authors).
|
| |
7
|
GILBERT, E.N., AND POLLAK, H.O. Steiner minimal trees. SIAM J. Appl. Math. 16 (1968), 1-29.
|
| |
8
|
HARARY, F. Graph Theory. Addison-Wesley, Reading, Mass., 1969.
|
| |
9
|
JOHNSON, S M. Generation of permutations by adjacent transportation. Math. Comput. 17 (1963), 282-285.
|
| |
10
|
ME~ZAK, Z.A. On the problem of Steiner. Canad. Math. Bull. 4 (1961), 143-148.
|
| |
11
|
PRIM, R.C. Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36 (1957), 1389-1401.
|
REFERENCES
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.2