期刊文献+

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

A class of 4-tight optimal double-loop networks infinite family
下载PDF
导出
摘要 找出给定顶点数的双环网的最小直径是图论和计算机工作者重点研究的问题之一.虽然大多数双环网可以达到紧优,但仍然有一部分双环网不能达到.本文给出了一类4-紧优的双环网无限族. The problem of finding optimal diameter double loop network with a fixed number of vertices has been widely studied by graph theory and computer science researchers. Although mostly is tight for infinite values of N,still some of them can not be tight. The paper gives a class 4-tight optimal double loop network infinite family.
作者 马军生
出处 《周口师范学院学报》 CAS 2007年第5期13-16,共4页 Journal of Zhoukou Normal University
关键词 直径 双环网 最优族 L-型瓦 Smith标准型 diameter double-loop network optimal family L-shaped ti tie smith no rmal form
  • 相关文献

参考文献9

  • 1Fiol M A, Yebra J L A,Alegre l,et al. A discrete optimization problem in local networks and data alignment[J]. IEEE Trans. Comput, 1987,36(C):702 - 713.
  • 2Cheng Y, Huang F K. Diameters of weighted double loop networks[J]. J. Algorithm, 1998,9 : 401 - 410.
  • 3Esque P, Aguilo F,Fiol M A. Double commutative-step digraphs with minimum diameters[J]. Discrete Math. ,1993, 114:147 - 157.
  • 4Chen C, Hwang F K. The minimum distance diagram of double-loop networks[J]. IEEE Trans. oncomputer, 2000,49: 977 - 979.
  • 5Aguilo-Gost F. A C. A. S. treatment of optimal-diameter double-loop digraphs families[J]. Electronic Nots Discrete Mathematics, 2002,11.
  • 6Bermond J C, Comellas F,Hsu D F. Distributed loop computer networks: A survey[J]. J. Parallel Distrib. Comput. , 1995,24:2-10.
  • 7Huang F K. A survey on double loop networks[J]. DIMACS Ser. in Discrete Math. , 1987,66:109 -118.
  • 8Aguilo F,Fiol M A. An efficient algorithm to find optimal double loop network[J]. Discrete Math. , 1995,138:15 -29.
  • 9Erdos P,Hsu D F. Distributed loop networks with minimum transmission delay[J]. Theoret. Comput. Sci. , 1992,100: 223 - 241.

同被引文献8

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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