摘要
基于图论理论,将有向通信网映射成有向图,探讨了有向通信网的广播时间问题,给出了n个结点的有向网络的1-容错和2-容错广播所需的最少时间。
Based on graph theory, the directed graph is mapped to the directed communication network; the problem of broadcasting-time for directed communication network is studied. For having an n-nodes directed communication network, the minimum time on 1- fault tolerant broadcasting and 2-fault tolerant broadcasting is given.
出处
《北京印刷学院学报》
2007年第6期67-69,共3页
Journal of Beijing Institute of Graphic Communication
基金
北京市属市管高等学校人才强教计划资助项目PHR(IHLB)
关键词
有向通信网
广播
容错
directed communication network
broadcasting
fault tolerant
