| 一种计算网络加权可靠度的新算法 |
| |
| 引用本文： | 刘陈. 一种计算网络加权可靠度的新算法[J]. 南京邮电大学学报(自然科学版), 2000, 20(2): 22-26 |
| |
| 作者姓名： | 刘陈 |
| |
| 作者单位： | 南京邮电学院教务处,江苏南京,210003 |
| |
| 摘 要： | 提出了一种计算网络加权可靠度的新算法，提出了容量饱和状态的概念，给出了最小路展开为限定子集之和的递推公式，基于该递推公式最小路的展开将不再生成与网络加权可靠度无关的限定子集，省去了不必要的展开计算，因此本文算法较以往算法具有较小的计算量。
|
| 关 键 词： | 加权；可靠性；容量；最小路 |
| 文章编号： | 1000-1972(2000)02-0022-05 |
| 修稿时间： | 1999-10-08 |
A New Algorithm for the Weighted Reliability of Networks |
| |
| LIU Chen. A New Algorithm for the Weighted Reliability of Networks[J]. JJournal of Nanjing University of Posts and Telecommunications, 2000, 20(2): 22-26 |
| |
| Authors: | LIU Chen |
| |
| Affiliation: | LIU Chen;(Department of Educational Administration, Nanjing University of Posts and Telecommunications, Nanjing 210003,China) |
| |
| Abstract: | This paper proposes a new algorithm for the weighted reliability of networks, puts forward the concept of saturated state of capacity, and suggests a recursive formula for expanding the minimal paths to be the sum of qualifying subsets. By this formula, the expansion of the minimal paths doesn' t creat the irrelevant qualifying subsets, thus decreasing the unnecessary expanding calculation. Compared with the current algorithms, this algorithm has the advantage of a small amount of computation for computer implementation. |
| |
| Keywords: | Weighting Reliability Capacity Minimal paths |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
