可分拟满Steiner树的结构性质与最优生成算法的研究
THE STUDY ON THE STRUCTURE PROPERTIES OF SEPARABLE QUASI-FULL TREE AND THE OPTIMAL GENERATING ARITHMETIC
摘要
研究可分拟满Steiner树的结构性质与最优可分拟满Steiner树的生成算法.
This paper shows the structure properties of Separable Quasi - Full Steriner Tree and the genemrlng arithmerle of optimal Separable Quasi - Full Steriner Tree.
出处
《哈尔滨师范大学自然科学学报》
CAS
2008年第4期31-33,共3页
Natural Science Journal of Harbin Normal University
关键词
可分拟满Steiner树
结构性质
生成算法
Separable Quasi - Full Steriner Tree
Structure properties
Generating arithmetic
参考文献4
-
1Garey M R, Graham R L, Johnson D S. The Complexity of Computing Steiner Minimal Trees. SIAM J Appl( Math), 1977 (32) :835 -859.
-
2Gilbert E N, Pollak H O. Steiner Minimal Trees. SIAM J Appl Math, 1965(16) :1 -29.
-
3Ding Zhu Du, Hwang F K, Guo Dong Song, et al. Steiner Minimal Trees on Sets of Four Points. Discrete Comput, Geom, 1987(2) :401 -414.
-
4Ji Yu Ding, Guo Dong Song. On optimal network with quasi - full Steiner topology. Comblnatorics and Graph Theory. World Scentiflc Publishing Co. Pte, Ltd. , 1993:216 -228.
