相似文献/References:
[1]边琼芳 邰伟鹏.无向双环网络G(N;±1,±s)的直径求解改进算法[J].计算机技术与发展,2008,(05):135.
BIAN Qiong-fang,TAI Wei-peng.An Improved Algorithm to Calculate Diameter Undirected Double - Loop Networks G ( N ; ± 1,± s )[J].,2008,(03):135.
[2]刘明 秦飞 汤红霞 方木云.双环网络G(N;r,s)生成树的研究[J].计算机技术与发展,2007,(10):46.
LIU Ming,QIN Fei,TANG Hong-xia,et al.Research on Minimum Cost Spanning Tree of Double - Loop Networks G (N ; r, s )[J].,2007,(03):46.
[3]秦飞 刘明 汤红霞 方木云.基于生成树的双环网络G(N;1,s)直径求解算法[J].计算机技术与发展,2007,(11):57.
QIN Fei,LIU Ming,TANG Hong-xia,et al.Algorithm for Calculating Tight Optimal Double- Loop Networks G (N ; 1, s ) Based on Span - Tree[J].,2007,(03):57.
[4]姜太平,徐超,邰伟鹏,等. 等价三叉树模型的三环网络TL(N;1,s2,s3)研究[J].计算机技术与发展,2015,25(06):21.
JIANG Tai-ping,XU Chao,TAI Wei-peng,et al. Research on Triple-loop Networks TL(N;1,s2,s3) of Ternarytree Model[J].,2015,25(03):21.
[5]丁蕾 方木云 甘丽.有向双环网和无向双环网直径规律的对比[J].计算机技术与发展,2009,(04):80.
DING Lei,FANG Mu-yun,GAN Li.Compare Diameters of Directed and Undirected Double Loop Networks[J].,2009,(03):80.