A cut-based method for terminal-pair reliability

Yu G. Chen; Maria C. Yuang

doi:10.1109/24.536994

A cut-based method for terminal-pair reliability

Yu G. Chen^*, Maria C. Yuang

^*Corresponding author for this work

National Chiao Tung University

Research output: Contribution to journal › Article

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 language	English
Pages (from-to)	413-416
Number of pages	4
Journal	IEEE Transactions on Reliability
Volume	45
Issue number	3
DOIs	https://doi.org/10.1109/24.536994
State	Published - 1 Dec 1996

Keywords

Factoring
Network reduction
Partitioning
Terminal-pair reliability

Access to Document

10.1109/24.536994

Link to publication in Scopus

Cite this

Chen, Y. G., & Yuang, M. C. (1996). A cut-based method for terminal-pair reliability. IEEE Transactions on Reliability, 45(3), 413-416. https://doi.org/10.1109/24.536994

@article{6fbe2d388a844826bd928942201f620e,

title = "A cut-based method for terminal-pair reliability",

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.",

keywords = "Factoring, Network reduction, Partitioning, Terminal-pair reliability",

author = "Chen, {Yu G.} and Yuang, {Maria C.}",

year = "1996",

month = dec,

day = "1",

doi = "10.1109/24.536994",

language = "English",

volume = "45",

pages = "413--416",

journal = "IEEE Transactions on Reliability",

issn = "0018-9529",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "3",

}

TY - JOUR

T1 - A cut-based method for terminal-pair reliability

AU - Chen, Yu G.

AU - Yuang, Maria C.

PY - 1996/12/1

Y1 - 1996/12/1

N2 - 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.

AB - 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.

KW - Factoring

KW - Network reduction

KW - Partitioning

KW - Terminal-pair reliability

UR - http://www.scopus.com/inward/record.url?scp=0030247140&partnerID=8YFLogxK

U2 - 10.1109/24.536994

DO - 10.1109/24.536994

M3 - Article

AN - SCOPUS:0030247140

VL - 45

SP - 413

EP - 416

JO - IEEE Transactions on Reliability

JF - IEEE Transactions on Reliability

SN - 0018-9529

IS - 3

ER -