A cut-based method for terminal-pair reliability
檔案
- A1996VK79600017.pdf (485.0 KB, Adobe PDF)
日期
1996-09-01
類型
期刊名稱
IEEE TRANSACTIONS ON RELIABILITY
卷期與頁次
第 45 卷第 3 期,頁 413–416
ISSN
0018-9529
語言
英文
摘要
Summ. & Conclusions - This paper assesses two categories of partition techniques for computing terminal-pair reliability (path-based and cut-based algorithms) by experimenting on published benchmarks; the criteria are the number of subproblems and the computation time. The cut-based algorithm is superior to the path-based algorithm with respect to the computation time for most benchmarks. A refinement of the cut-based algorithm (using network reduction) profoundly outperforms the path-based algorithm (with reduction) for all benchmarks.