欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
对紧优双环网络G（N；1，s）的直径求解算法做了研究，提出基于生成树的紧优双环网络G（N；1，s）求解算法，给出了双环网络的直径d（N；1，s）公式．对生成树的性质做了研究。利用C#作为编程语言来实现这一算法，并对生成树的结构模型进行了仿真实现。验证了双环网络直径的分布特点：具有最大值、最小值和中间对称性。对任意给定N而2≤s≤N-1的这样一系列双环网络中的所有的紧优双环网络都可以计算出来。该算法的时间复杂度为O（N）。
英文摘要：
The algorithm for calculating tight optimal double loop networks G （ N; 1, s） were studied in this paper. A new method - based on span- tree is presented to calculate the diameter of double - loop networks G （ N; 1, s ）. A simple formula for expressing d （ N; 1, s ） of this network is presented. Attributes of the intuitional model - span tree were studied. With C# as program, the algorithm was simulated, and the span tree models were given. The results verify that the diameter of such family of double- loop networks has such characters： maximum values, minimum values and symmetry. The tight optimal double- loop networks in such family ,whose N was given randomly and s varied form 2 to N - 1 ,can be calculated. The time complexity of this algorithm is O（N） .
同期刊论文项目
同项目期刊论文
期刊信息
位置：