Bounding Two-Terminal Network Reliability via Surface Duality
Given a two-terminal (possibly directed) network with assigned edge probabilities, we establish that upper bounds on the reliability of any surface dual can be used to obtain lower bounds on the reliability of the primal. This observation leads to valuable new techniques for obtaining efficiently computable lower bounds on two-terminal reliability.
KeywordsPlanar Graph Network Reliability Edge Probability Dual Edge Terminal Pair
Unable to display preview. Download preview PDF.
- H.M. AboElFotoh, C.J. Colbourn, “Series-Parallel Bounds for the Two- Terminal Reliability Problem”, ORSA J. Comp (1988), 209–222.Google Scholar
- C.J. Colbourn, The Combinatorics of Network Reliability, Oxford University Press, Oxford, 1987.Google Scholar
- D.D. Harms, A Symbolic Algebra Environment for Research in Network Reliability Ph.D. Thesis, Simon Eraser University (1992).Google Scholar
- H. Strayer, C. Colbourn, “Bounding Network Reliability via Surface Duality”, preprint.Google Scholar