摘要
对于网络出版传播中的广播时间问题,借助图论理论通过分析图的连通度,给出了确定网络单信息广播时间一个界的方法,实例证明该界是可以通过计算得到的。
Broadcasting is a basic problem of publication and communication in networks. In this paper, using of graph theory and by analyzing graph's connected degree, we find a way to obtain one bound of broadcasting-time for single information. It can be illustrated that the bound is available through calculation.
出处
《北京印刷学院学报》
2004年第1期3-6,27,共5页
Journal of Beijing Institute of Graphic Communication
基金
北京市教育委员会科技发展计划项目资助(KM200310015060)
北京市优秀人才培养专项经费资助
关键词
网络出版传播
广播时间
图论
连通度
计算方法
单信息广播
结点
publication and communication in networks, broadcasting-time, connected degree, graph theory.