无向双环网络G(N;±1,±s)的直径求解改进算法  

An Improved Algorithm to Calculate Diameter Undirected Double-Loop Networks G(N;±1,±s)

作　　者：边琼芳[1] 邰伟鹏[1] 

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

出　　处：《计算机技术与发展》2008年第5期135-137,共3页Computer Technology and Development

基　　金：国家自然科学基金(60473142)

摘　　要：利用计算机算法研究无向双环网络直径在国内外文献中尚不多见,文献[1]中提出了一种算法,并成功实现,其不足之处是利用数据库存取中间结果,严重影响了计算速度,当N值很大时需要计算的时间过长。针对这一不足,提出利用数组取代数据库来存取中间结果的改进算法。实验结果表明该算法较文献[1]算法极大地提高了运算速度,并列出了两个N大值直径分布图。There are few reports using simulation to research the diameter of double- loop networks. Reference[ 1 ]presented an algorithm, and realized the simulation. But the disadvantage of this algorithm is using database technology to keep middle results and this seriously affected the calculation speed. When N becomes very large, it spends too much time calculating. In response of the disadvantage, presents an improved algorithm that uses an array to replace the database for keeping medium results. The result of experiments indicated tha the improved algorithm improved the speed of calculations, and lists the two diameter distribution maps of N.

关 键 词：无向双环网络 紧优 直径 算法 族 

分 类 号：O157.6[理学—数学] TP302[理学—基础数学]