A cut-based method for terminal-pair reliability

Yu G. Chen*, Maria C. Yuang

*Corresponding author for this work

Research output: Contribution to journalArticle

42 Scopus citations

Abstract

This paper assesses two categories of partition techniques for computing terminal-pair reliability (pathbased 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 pathbased 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.

Original languageEnglish
Pages (from-to)413-416
Number of pages4
JournalIEEE Transactions on Reliability
Volume45
Issue number3
DOIs
StatePublished - 1 Dec 1996

Keywords

  • Factoring
  • Network reduction
  • Partitioning
  • Terminal-pair reliability

Cite this