A SIMPLE ALGORITHM FOR COMPUTING NETWORK RELIABILITY

被引：0
|
作者：
SINGH, B
机构：
来源：
NATIONAL ACADEMY SCIENCE LETTERS-INDIA | 1992年 / 15卷 / 05期
关键词：
ALGORITHM; MINIMAL PATHS; DISJOINT PATHS; NETWORK RELIABILITY;
D O I：
暂无
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
A simple algorithm has been described for computing s-t network reliability. Using a set of rules and Boolean algebra, the mutually disjoint paths are directly obtained recursively. The reliability of the network can then be evaluated by taking the direct sum of the reliabilities of the disjoint paths. This technique is straight forward and simple for evaluating the network reliability. It has been illustrated by an example.
引用
收藏
页码：157 / 161
页数：5
相关论文
共 50 条
12345