標題: A cut-based method for terminal-pair reliability
作者: Chen, YG
Yuang, MC
交大名義發表
資訊工程學系
National Chiao Tung University
Department of Computer Science
關鍵字: terminal-pair reliability;factoring;partitioning;network reduction
公開日期: 1-九月-1996
摘要: 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.
URI: http://dx.doi.org/10.1109/24.536994
http://hdl.handle.net/11536/1049
ISSN: 0018-9529
DOI: 10.1109/24.536994
期刊: IEEE TRANSACTIONS ON RELIABILITY
Volume: 45
Issue: 3
起始頁: 413
結束頁: 416
顯示於類別:期刊論文


文件中的檔案:

  1. A1996VK79600017.pdf