基于生成树的双环网络G(N;1,s)直径求解算法  

Algorithm for Calculating Tight Optimal Double-Loop Networks G(N;1,s) Based on Span-Tree

作　　者：秦飞[1] 刘明[1] 汤红霞[1] 方木云[1] 

机构地区：[1]安徽工业大学计算机学院,安徽马鞍山243002

出　　处：《计算机技术与发展》2007年第11期57-59,66,共4页Computer Technology and Development

基　　金：国家自然科学基金资助项目(60473142)

摘　　要：对紧优双环网络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） .

关 键 词：双环网络 生成树 紧优 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]