|
|||||
|
|
| 已知拓扑下的最短网络 | |
| 引用本文： | 叶继昌,徐成贤. 已知拓扑下的最短网络[J]. 系统科学与数学, 2000, 20(3): 264-269 |
| 作者姓名： | 叶继昌 徐成贤 |
| 作者单位： | 1. 淄博学院计算机系, 山东淄博 255012 2. 西安交通大学理学院, 西安 710049 3. Xi'an Jiaotong University, Xi'an 710049 |
| 摘 要： | 在平面上给定一个有n个固定点的集合S和一个含有m个可动点的集合M及连接这些点的边的集合T(T也称之为拓扑),确定M中点的位置,使点集V=SM的互联网络最短.本文证明了n是偶数m=-1及在满4度Steiner拓扑下最短网络的结构是4度Steiner树. |
| 关 键 词： | 网络 Steiner问题 拓扑. |
| 修稿时间： | 1997-07-07 |
THE SHORTEST NETWORK UNDER A GIVEN TOPOLOGY |
|
| Ye Jichang,Xu Yinfeng,Xi'an Jiaotong University, Xi'an. THE SHORTEST NETWORK UNDER A GIVEN TOPOLOGY[J]. Journal of Systems Science and Mathematical Sciences, 2000, 20(3): 264-269 | |
| Authors: | Ye Jichang Xu Yinfeng Xi'an Jiaotong University Xi'an |
| Affiliation: | (1)Zibo University, Shandong Zibo 255012,P.R.China;(2)Xi'an Jiatong Univ.,Xi'an 710049,P.R.China |
| Abstract: | Given a set S of n fixed points, a set M of m moving points inthe plane and a set T of edgesconnecting these points (T is also called a topology), locate thepositions of m points in M such that the total length of the networkconnecting the set V=S M is minimized. Under the condition that nis even, m=[SX(]n[]2[SX)]-1 and T is a full 4 degree Steinertopology it is proved that the shortest network is a 4 degree steiner tree. |
| Keywords: | Networks Steiner problem topology |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |
| 点击此处可从《系统科学与数学》浏览原始摘要信息 | |
| 点击此处可从《系统科学与数学》下载全文 | |
