Lower bounds on two-terminal network reliability

@article{Brecht1988LowerBO,
  title={Lower bounds on two-terminal network reliability},
  author={Timothy B. Brecht and Charles J. Colbourn},
  journal={Discrete Applied Mathematics},
  year={1988},
  volume={21},
  pages={185-198}
}
One measure of two-terminal network reliability, termed probabilistic connectedness, is the probability that two specified communication centers can communicate. A standard model of a network is a graph in which nodes represent communications centers and edges represent links between communication centers. Edges are assumed to have statistically independent probabilities of failing and nodes are assumed to be perfectly reliable. Exact calculation of two-terminal reliability for general networks… CONTINUE READING
Highly Cited
This paper has 79 citations. REVIEW CITATIONS