The Delta-Wye approximation procedure for two-terminal reliability

Operations Research

Volumn 44, Issue 5, 1996, Pages 745-757

  Chari, Manoj K ^a   Feo, Thomas A ^b   Scott Provan, J ^c  

^a LOUISIANA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; GRAPH THEORY; MATHEMATICAL TRANSFORMATIONS; PROBABILITY; RELIABILITY;

DELTA WYE APPROXIMATION PROCEDURE; TWO TERMINAL RELIABILITY; UNDIRECTED PLANAR NETWORK;

ELECTRIC NETWORK ANALYSIS;

EID: 0030232129     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.44.5.745     Document Type: Article

References (23)

1. AKERS, S. B. 1960. The Use of Wye-Delta Transformations in Network Simplifications. Opns. Res. 8, 311-323.
2. BIENSTOCK, D. 1986. An Algorithm for Reliability Analysis of Planar Graphs. Networks, 16, 411-422.
3. BRECHT, T. B. AND C. J. COLBOURN. 1988. Lower Bounds for Two-Terminal Network Reliability. Discrete Appl. Math. 72, 49-61.
4. CHARI, M. K. AND J. S. PROVAN. 1994. Calculating K-connectedness Reliability using Steiner Bounds. Math. O.R., to appear.
5. COLBOURN, C. J. 1987. The Combinatorics of Network Reliability. Oxford University Press.
6. COLBOURN, C. J. 1988. Edge Packings of Graphs and Network Reliability. Discrete Math. 72, 49-61.
7. EPIFANOV, G. V. 1966. Reduction of a Plane Graph to an Edge by a Star-triangle Transformation. Doklady, 166, 13-17.
8. FEO, T. A. 1985. Efficient Reduction of Planar Networks for Solving Certain Combinatorial Problems. Ph.D. Dissertation. Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA.
9. FEO, T. A. AND J. S. PROVAN. 1993. Delta-Wye Transformations and the Efficient Reduction of Two-terminal Planar Graphs. Opns. Res. 41, 572-582.
10. GITLER, I. 1991. Delta-Wye Reducibility of Graphs. Ph.D. Thesis. Department of Combinatorics and Optimization, University of Waterloo.
11. HOPCROFT, J. E. AND R. E. TARJAN. 1974. Efficient Planarity Testing. J. ACM, 21, 549-568.
12. LEHMAN, A. 1963. Wye-Delta Transformations in Probabilistic Network. J. SIAM, 11, 773-805.
13. PAGE, L. B. AND J. E. PERRY. 1988. A Practical Implementation of the Factoring Algorithm for Network Reliability. IEEE Transactions on Reliability. 37, 259-267.
14. PROVAN, J. S. AND M. O. BALL. 1984. Computing Network Reliability in Time Polynomial in the Number of Cuts. Opns. Res. 15, 694-702.
15. PROVAN, J. S. 1986. The Complexity of Reliability Computations in Planar and Acrylic Graphs. SIAM J. Comput. 15, 694-702.
16. SATYARARAYANA, A. AND R. K. WOOD. 1985. A Linear-time Algorithm for Computing K-terminal Reliability in Series-parallel Graphs. SIAM J. Comput. 14, 818-832.
17. SHIER, D. R. 1988. Algebraic Aspects of Computing Network Reliability, in Applications of Discrete Mathematics. R. D. Ringeisen and F. S. Roberts (eds), SIAM Publications, Philadelphia, PA.
18. SHIER, D. R. 1991. Network Reliability and Algebraic Structures. Oxford Science Publications, Oxford University Press, New York.
19. TRUEMPER, K. 1989. On the Delta-Wye Reduction for Planar Graphs. J. Graph Theory, 13, 141-148.
20. VALIANT, L. G. 1979. The Complexity of Enumeration and Reliability Problems. SIAM J. Comput. 8, 410-421.
21. VAN SLYKE, R. M. AND H. FRANK. 1972. Network Reliability Analysis: Part I. Networks, 1, 279-290.
22. WALD, J. A. AND C. J. COLBOURN. 1983. Steiner Trees in Probabilistic Networks. Microelectronics and Reliability, 23, 837-840.
23. WHITED, D. E., D. R. SHIER, AND J. P. JARVIS. 1990. Reliability Computations for Planar Networks. ORSA J. Comput. 2, 46-60.