期刊文献+

一类3-紧优双环网无限族 被引量:3

A Class 3-tight Double-loop Networks Infinite Family
下载PDF
导出
摘要 到给定顶点数的双环网的最小直径是图论和计算机工作者广泛研究的问题。虽然大多数双环网可以达到紧优,但仍然有一部分双环网不能达到。本文给出了一类3-紧优的双环网无限族。 The problem of finding optimal diameter double network with a fixed number of vertices has been widely studied by grapy theory and computer science researchers. Although most loop networks are tight for infinite values of interger N, still some of them can not be tight. Th gives a class 3 -tight optimal double loop network infinite families. double e paper
作者 马军生 朱敏
出处 《江西科学》 2007年第4期363-366,共4页 Jiangxi Science
关键词 双环网 最优族 直径 L-型瓦 Smith标准型 Double - loop network, Optimal family, Diameter, L - shaped rifle, Smith normal form
  • 相关文献

参考文献11

  • 1Fiol M A,Yebra J L A,Alegre I,et al.A discrete optimization problem in local networks and data alignment[J].IEEE Trans.Comput.,1987,C-36:702-713.
  • 2Cheng Y,Hwang F K.Diameters of weighted double loop networks[J].J.Algorithm,1998,9:401-410.
  • 3Erd(o)s P,Hsu D F.Distributed loop networks with minimum transmission delay[J].Theoret.Comput.Sci.,1992,100:223-241.
  • 4Esqué P,Aguiló F,Fiol M A.Double commutative-step digraphs with minimum diameters[J].Discrete Math.,1993,114:147-157.
  • 5Hwang F K,XU Y H.Double loop networks with minimum delay[J].Discrete Math.,1987,66:109-118.
  • 6Wong C K,Coppersmith D.A combinatorial problem related to multimode memory orgamizations[J].J.ACM,1974,21:392-402.
  • 7Chen C,Hwang F K.The minimum distance diagram of double-loop networks[J].IEEE Trans.on computer,2000,49:977-979.
  • 8Aguiló-Gost.A C.A.S.treatment of optimal-diameter double-loop digraphs families[J].Electronic Nots Discrete Mathematics,2002,11:408-411.
  • 9Bermond J C,Comellas F,Hsu D F.Distributed loop computer networks:A survey[J].J.Parallel Distrib.Comput.,1995,24:2-10.
  • 10Hwang F K.A survey on double loop networks[J].DIMACS Ser.in Discrete Math.,1987,66:109-118.

同被引文献21

  • 1陈协彬.步长有限制的双环网络的最优路由算法[J].计算机学报,2004,27(5):596-603. 被引量:34
  • 2李乔,徐俊明,张忠良.最优双环网络的无限族[J].中国科学(A辑),1993,23(9):979-992. 被引量:71
  • 3周建钦.k紧优双环网络及其无限族[J].数学学报(中文版),2005,48(6):1213-1220. 被引量:17
  • 4陈宝兴,肖文俊.k-紧优有向双环网络无限族的构建[J].应用数学学报,2006,29(2):362-367. 被引量:3
  • 5FIOL M A, YEBRA J L A, ALEGRE I, et al. A discrete optimization problem in local networks and data alignment[J]. IEEE Trans Comput , 1987, 36 (6): 702-713.
  • 6CHEN C, HWANG F K. The minimum distance diagram of double-loop networks[J]. IEEE Trans on Computer, 2000, 49 : 977-979.
  • 7AGUILO-GOS F. A C. A. S. treatment of optimal-diameter double loop digraphs families [ J ]. Electronic Notes Discrete Math, 2002, 11: 408- 411.
  • 8AGUILO F, FIOL M A. An efficient algorithm to find optimal double loop network [J]. Discrete Math, 1995, 138: 15-29.
  • 9BERMOND J-C, COMELLAS F, HSU D F. Distributed loop computer networks: A survey[J]. J Parallel Distrib Comput, 1995, 24: 2-10.
  • 10CHENG Y, HWANG F K. Diameters of weighted double loop networks[J]. J Algorithm, 1998, 9: 401-410.

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部