| 星形网络上的最可靠广播源问题 |
| |
| 引用本文： | 周瑜,陈光亭. 星形网络上的最可靠广播源问题[J]. 杭州电子科技大学学报, 2014, 0(1): 57-59 |
| |
| 作者姓名： | 周瑜 陈光亭 |
| |
| 作者单位： | 杭州电子科技大学理学院,浙江杭州310018 |
| |
| 摘 要： | 不可靠网络上最可靠广播源问题是网络可靠性问题的一种。该文讨论了星形网络中最可靠广播源问题与最可靠双广播源问题,并针对这两个问题分别给出了两个多项式时间算法。
|
| 关 键 词： | 最可靠广播源 可达概率 择优概率 |
The Most Reliable Source Problem on a Star |
| |
| Zhou Yu,Chen Guangting. The Most Reliable Source Problem on a Star[J]. Journal of Hangzhou Dianzi University, 2014, 0(1): 57-59 |
| |
| Authors: | Zhou Yu Chen Guangting |
| |
| Affiliation: | Zhou Yu, Chen Guangting |
| |
| Abstract: | The most reliable source problem on unreliable networks is a type of network reliability problem . In this paper , we study the most reliable source problem and the most reliable two sources problem on star networks , and devise polynomial time algorithms for them . |
| |
| Keywords: | most reliable source reachable probability superior probability |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
