期刊文献+

一类1-紧优双环网无限族

A class of 1-tight optimal double-loop networks infinite families
下载PDF
导出
摘要 目的找到新的1-紧优双环网无限族。方法利用双环网的k-紧瓦母型理论进行推导。结果给出了一类新的1-紧优双环网无限族。结论拓展了双环网无限族类。 Aim The proof was offered to find a new infinite family of 1-tight optimal double loop network. Methods The new infinite family was derived from the theory of k-tight title of double loop network. Results A new 1-tight optimal double loop network was given. Conclusion The infinite family of double loop network was expanded.
出处 《宝鸡文理学院学报(自然科学版)》 CAS 2009年第1期9-12,共4页 Journal of Baoji University of Arts and Sciences(Natural Science Edition)
关键词 双环网 最优族 直径 L-型瓦 Smith标准型 double loop network optimal family diameter L-shaped title Smith normal form
  • 相关文献

参考文献10

  • 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, 36 (6): 702-713.
  • 2CHEN C, HWANG F K. The minimum distance diagram of double-loop networks[J]. IEEE Trans on Computer, 2000, 49 : 977-979.
  • 3AGUILO-GOS F. A C. A. S. treatment of optimal-diameter double loop digraphs families [ J ]. Electronic Notes Discrete Math, 2002, 11: 408- 411.
  • 4AGUILO F, FIOL M A. An efficient algorithm to find optimal double loop network [J]. Discrete Math, 1995, 138: 15-29.
  • 5BERMOND J-C, COMELLAS F, HSU D F. Distributed loop computer networks: A survey[J]. J Parallel Distrib Comput, 1995, 24: 2-10.
  • 6CHENG Y, HWANG F K. Diameters of weighted double loop networks[J]. J Algorithm, 1998, 9: 401-410.
  • 7ERDOS P, HSU D F. Distributed loop networks with minimum transmission delay [ J ]. Theoret Comput Sci, 1992, 100: 223-241.
  • 8ESQUE P, AGUILO F, FIOL M A. Double commutative-step digraphs with minimum diameters [J]. Discrete Math, 1993, 114: 147-157.
  • 9HWANG F K. A survey on double loop networks [J]. DIMACS Ser in Discrete Math, 1987, 66: 109-118.
  • 10马军生,朱敏.一类3-紧优双环网无限族[J].江西科学,2007,25(4):363-366. 被引量:3

二级参考文献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.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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