| 基于图论模型的三环网络G（N；1，s，s＋1）直径分布算法 |
| |
| 引用本文： | 边琼芳,邰伟鹏,苏小虎,郑啸.基于图论模型的三环网络G（N；1，s，s＋1）直径分布算法[J].安徽工业大学学报,2012(4):371-374. |
| |
| 作者姓名： | 边琼芳 邰伟鹏 苏小虎 郑啸 |
| |
| 作者单位： | 安徽工业大学计算机科学系 |
| |
| 基金项目： | 国家青年自然科学基金项目(61003311);安徽省高校自然科学基金项目(KJ2010A051) |
| |
| 摘 要： | 针对三环网络，提出一种基于图论模型的直径求解算法。从图论模型出发，以仿真方法得到对于任意给定的N，2≤s≤N-2这样一族三环网络的直径，并得出对于任意的N，有一些S使得G（N：1，s，s＋1）紧优。利用C＋＋编程计算出三环网络的直径分布图，并分析其直径分布特点。
|
| 关 键 词： | 三环网络 直径 紧优 族 图论模型 |
Algorithm of Diameter Distribution of Triple-loop Networks G(N;1,s,s+1) Based on Graph Theory Model |
| |
| BIAN Qiong-fang,TAI Wei-peng,SU Xiao-hu,ZHENG Xiao.Algorithm of Diameter Distribution of Triple-loop Networks G(N;1,s,s+1) Based on Graph Theory Model[J].Journal of Anhui University of Technology,2012(4):371-374. |
| |
| Authors: | BIAN Qiong-fang TAI Wei-peng SU Xiao-hu ZHENG Xiao |
| |
| Affiliation: | (School of Computer Science,Anhui University of Technology,Ma’anshan 243002,China) |
| |
| Abstract: | A diameter solution algorithm based on graph theory model was proposed.With graph theory model and simulation method,the diameters of such family of triple-loop networks,whose N is given random and s varied from 2 to N-2 were calculated.For any given N,some s values make G(N;1,s,s + 1) tight optimal.With C++ diameter distribution sketches of triple-loop network were simulated,and characteristics of them were analyzed. |
| |
| Keywords: | triple-loop networks diameter tight optimal family graph theory model |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
