USING THE DECOMPOSITION TREE FOR DIRECTED-NETWORK RELIABILITY COMPUTATION.

被引:0
|
作者
Hagstrom, Jane N. [1 ]
机构
[1] Univ of Illinois at Chicago Circle,, Dep of Quantitative Methods,, Chicago, IL, USA, Univ of Illinois at Chicago Circle, Dep of Quantitative Methods, Chicago, IL, USA
关键词
RELIABILITY THEORY;
D O I
暂无
中图分类号
学科分类号
摘要
A related paper provides an algorithm to compute the reliability of an undirected network. The algorithm exploits the decomposition tree of the network derived from decomposing the network graph into its triconnected components. This paper extends the algorithm to apply to reliability problems involving directed networks. Details are presented which specialize the algorithm to apply to the problems of 2-terminal communication, transportation flow feasibility, and path-length feasibility.
引用
收藏
页码:390 / 395
相关论文
共 50 条