期刊文献+

图论在网络出版传播中的应用

Applications of Graph Theory on Publish and Communication in Networks
原文传递
导出
摘要 利用图论理论研究了网络连通度与广播时间的关系问题 ,获得了网络单信息广播时间的一个界和最少时间广播网的几个充分条件 ,并建立了一个有效的广播方案 . Using of graph theory to study the problem of relation for connected degree and broadcasting-time in networks, obtain a bound of broadcasting-time for single information and some sufficiency terms of minimum broadcasting-time networks, and construct an effective broadcasting scheme.
作者 朱晓峰
出处 《数学的实践与认识》 CSCD 北大核心 2005年第1期137-141,共5页 Mathematics in Practice and Theory
基金 北京市教育委员会科技发展计划项目资助 (KM2 0 0 3 1 0 0 1 5 0 60 ) 北京市优秀人才培养专项经费资助
关键词 网络出版 广播网 传播 关系问题 信息 理论研究 时间 图论 连通度 充分条件 broadcasting-time connected degree graph matching
  • 相关文献

参考文献6

  • 1朱晓峰.立方体网络路由选择算法[J].数学的实践与认识,2002,32(1):70-74. 被引量:3
  • 2Gray M R, Johnson D S. Computers and Intractability a Guide to the Theory of NP-Completeness[M]. W. H.Freeman and Company press Itd, 1979.
  • 3Hormkoric J, Jeschke C D. Monien B. Optimal algorithms for dissemination networks[J]. In: Proc. MFCS'90,Lecture Notes in Computer Science (Springer, Berlin, 1990): 337--346.
  • 4Stohr E. Broadcasting in the butterfly network[J]. Infor Proc Letters, 1991, 39:41--43.
  • 5Liestman A L, Peters J G. Broadcast networks of bounded degree[J]. SIAM J Disc Math, 1988, 1: 531--540.
  • 6Bondy J A, Murty U S R. Graph Theory with Applications[M]. The Macmllian press Itd, London 1976.

二级参考文献8

  • 1[1]Wu J.Safety level-an efficient mechanism for achieving reliable broadcasting in hypercubes[J].IEEE Trans Computers,1995,44(5): 702~705.
  • 2[2]CHIU Ge-ming,CHEN Kai-shung.Use of routing capability for fault-tolerant routing in hypercube multicomputers[J].IEEE Trans Computers,1997,46(8): 953~958.
  • 3[3]Wu J.Reliable unicasting in faulty hypercubes using safety levels[J].IEEE Trans Computers,1997,46(2): 241~247.
  • 4[4]Bondy J A,Murty U S R.Graph Theory with Applications[M].The Macmllian press Itd London,1976.
  • 5[5]Chiu G M,Wu S P.A fault-tolerant routing strategy in hypercube multicomputers[J].IEEE Trans Computers,1996,45(2): 143~156.
  • 6[6]Gordon J M,Stout Q F.Hypercube message routing in the presence of fault[J].Proc Third Conf Hypercube concurrent computers and applications,1988,251~263.
  • 7[7]Lan Y.A Fault-Tolerant Routing Algorithm in Hypercubes[C].Proc 1994 Int′l Conf Parallel Processing,pp.Ⅲ 163-Ⅲ 166,Aug.1994.
  • 8[8]Lee T C,Hayes J P.A fault-tolerant communication scheme for hypercube computers[J].IEEE Trans Computers,1992,41(10): 1242~1256.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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