The Delta-Wye Approximation Procedure for two-terminal reliability
成果类型：
Article
署名作者：
Chari, MK; Feo, TA; Provan, JS
署名单位：
University of North Carolina; University of North Carolina Chapel Hill; University of Texas System; University of Texas Austin
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.44.5.745
发表日期：
1996
页码：
745-757
关键词：
摘要：
The Delta-Wye Approximation Procedure (DWAP) is a procedure for estimating the two-terminal reliability of an undirected planar network G = (V, E) by reducing the network to a single edge via a sequence of local graph transformations. It combines the probability equations of Lehman - whose solutions provide bounds and approximations of two-terminal reliability for the individual transformations-with the Delta-Wye Reduction Algorithm of the second two authors - which performs the corresponding graph reduction in O(\V\(2)) time. A computational study is made comparing the DWAP to one of the best currently known methods for approximating two-terminal reliability, and it is shown that the DWAP produces approximations that are between 10 and 80 times as accurate.