| 一种计算广播型网络可靠度的新方法 |
| |
| 引用本文： | 刘陈,郑惠莉,吴新余,沈元隆.一种计算广播型网络可靠度的新方法[J].南京邮电大学学报(自然科学版),1995(4). |
| |
| 作者姓名： | 刘陈 郑惠莉 吴新余 沈元隆 |
| |
| 作者单位： | 南京邮电学院基础课部，南京邮电学院管理系 |
| |
| 基金项目： | 邮电部高等院校中青年教师科学基金 |
| |
| 摘 要： | 介绍了初等有向树变换的概念，并基于初等有向树变换给出了一种计算广播型网络可靠度的新方法，该方法不需进行非独立事件和的概率计算或有向树的专门不交化处理，因而所需计算量较小。
|
| 关 键 词： | 图论，网络分析，可靠性 |
A New Algorithm for Computing Reliability of Broadcasting-form Networks |
| |
| Liu Chen, Zhen Huili,Wu Xinyu, Shen Yuanlong.A New Algorithm for Computing Reliability of Broadcasting-form Networks[J].Journal of Nanjing University of Posts and Telecommunications,1995(4). |
| |
| Authors: | Liu Chen Zhen Huili Wu Xinyu Shen Yuanlong |
| |
| Abstract: | The concept of elementary directed tree transformation is described. Based on elementary directed tree transformation, a new algorithm for computing the reliability of broadcasting-form networks is proposed. The algorithm can avoid the calculations for probability of the sum of dependent events and (or) addrtional directed tree-disjointing processing so that the amount of computations is relatively small. |
| |
| Keywords: | Graph theory Network analysis Reliability theory |
| 本文献已被 CNKI 等数据库收录！ |
