𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Network reliability with arc failures and repairs

✍ Scribed by Pulat, P.S.

Book ID
114555336
Publisher
IEEE
Year
1988
Tongue
English
Weight
437 KB
Volume
37
Category
Article
ISSN
0018-9529

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Network reliability with node failures
Network reliability with node failures
✍ Liu, Shaobin; Cheng, Kam-Hoi; Liu, Xiaoping πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 101 KB

Given a graph whose edges never fail but whose nodes fail independently of each other with a constant probability 1 ---p p p, the reliability of a graph is defined to be the probability that the induced subgraph of the surviving nodes is connected. Let Ω (n n n, m m m) be the class of all graphs wit

Maximal expected flow in a network subje
Maximal expected flow in a network subject to arc failures
✍ Y. P. Aneja; K. P. K. Nair πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 494 KB

## Abstract In a network subject to arc failures, each chain has a probability of failure. Therefore the maximal flow in the network is a random variable. The problem considered here is that of maximizing the expected flow. An arc‐chain formulation of the problem, and an algorithm for computing an