The Delta-Wye Approximation Procedure for Two-Terminal Reliability

  title={The Delta-Wye Approximation Procedure for Two-Terminal Reliability},
  author={Manoj K. Chari and Thomas A. Feo and J. Scott Provan},
  journal={Oper. Res.},
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… 
Algorithms to evaluate the reliability of a network
  • J. Galtier, A. Laugier, P. Pons
  • Computer Science
    DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.
  • 2005
Two different approaches to compute two-terminal and all-Terminal reliability are presented, with various characteristics on the precision level of the result.
Exact solutions for the two- and all-terminal reliabilities of a simple ladder network
It is shown that the zeros of the two-terminal reliability polynomial exhibit structures which differ substantially for seemingly similar networks, and it is discussed how the present work may be further extended to lead to a catalog of exactly solvable networks in terms of reliability.
Exact solutions for the two- and all-terminal reliabilities of the Brecht-Colbourn ladder and the generalized fan
The two- and all-terminal reliabilities of the Brecht-Colbourn ladder and the generalized fan have been calculated exactly for arbitrary size as well as arbitrary individual edge and node
Four terminal planar Delta-Wye reducibility via rooted K2, 4 minors
It is shown that a sufficiently connected cubic graph is wye-delta reducible if and only if it does not contain the Petersen graph as a minor.
A note on delta-wye-delta reductions of plane graphs
A connected plane graph G with two distinguished vertices can be reduced to a single edge between these two vertices using certain local transformations, including series/parallel reductions and
Reliability in Layered Networks with Random Link Failures
It is shown that maximizing the min cut of the (layered) network maximizes reliability in the low failure probability regime, and algorithms for routing the logical topology to maximize reliability are developed.
Combinatorial Aspects of Move-Up Crews for Spreading Processes on Networks
It is shown that the direct Monte Carlo approach is an FPRAS for the expected spreading size, but unless NP ⊆ BPP, there is no randomized constant-factor approximation for the probability of large spreadings.
Four-terminal reducibility and projective-planar wye-delta-wye-reducible graphs
This paper shows that four-terminal planar graphs are Y Y-reducible when at least three of the vertices lie on the same face, and considers terminals in projective-planar graphs.
Estimation of flows in flow networks
Time-dependent shortest paths in bounded treewidth graphs
We present a proof that the number of breakpoints in the arrival function between two terminals in graphs of treewidth $w$ is $n^{O(\log^2 w)}$ when the edge arrival functions are piecewise linear.


The Use of Wye-Delta Transformations in Network Simplification
It is shown that wye-delta transformations analogous to those used with electrical networks are available for the maximum-flow problem both with and without node capacities and that for the minimum-route problem dual transformations apply.
A practical implementation of the factoring theorem for network reliability
An implementation of an algorithm which uses the factoring theorem, in conjunction with degree-1 and degree-2 vertex reductions, to determine the reliability of a network is presented.
Note on "A Linear-Time Algorithm for Computing K-Terminal Reliability in a Series-Parallel Network"
In an original and very interesting paper concerning polygon-to-chain reductions in a stochastic network, a small inconsistency occurs in the proof of Theorem 1 where the whole set of {\bit K}-vertices lies in the remaining polygon.
Reliability Computations for Planar Networks
A pseudopolynomial algorithm is implemented, based on these generation procedures, to calculate two-terminal reliability for planar networks; that is, the algorithm's time complexity is polynomially bounded in the number of paths (or theNumber of cutsets).
Algebraic Aspects of Computing Network Reliability.
An iterative technique that provides at each iteration both upper and lower bounds on the exact reliability value is discussed, showing that for certain classes of graphs these bounds converge rapidly and provide excellent approximations to the true network reliability.
Delta-Wye Transformations and the Efficient Reduction of Two-Terminal Planar Graphs
A simple, O(|V|2) time algorithm is presented that reduces a connected two-terminal, undirected, planar graph to a single edge, by way of series and parallel reductions and delta-wye transformations.
A Linear Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Graphs
An O(IEI) algorithm is presented for computing the reliability of any series-parallel graph irrespective of the vertices in K, and a new set of reliability-preserving "polygon-to-chain" reductions of general applicability is introduced which decreases the size of a graph.
Network reliability analysis: Part I
This paper considers networks with randomly failing links and nodes and combines a combinatorial analysis with stratified sampling to yield major computational savings.