## Abstract

Computing the probability that two nodes in a probabilistic network are connected is a well-known computationally difficult problem. Two strategies are devised for obtaining lower bounds on the connection probability for two terminals. The first improves on the Kruskal-Katona bound by using efficient computations of small pathsets. The second strategy employs efficient algorithms for finding edge-disjoint paths. The resulting bounds are compared; while the edge-disjoint path bounds typically outperform the Kruskal-Katona bounds, they do not always do so. Finally, a method is outlined for developing a uniform bound which combines both strategies.

Original language | English (US) |
---|---|

Pages (from-to) | 185-198 |

Number of pages | 14 |

Journal | Discrete Applied Mathematics |

Volume | 21 |

Issue number | 3 |

DOIs | |

State | Published - Oct 1988 |

Externally published | Yes |

## Keywords

- Network reliability
- efficient algorithm
- reliability bound
- topological design
- two-terminal reliability

## ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics