✦ LIBER ✦

Non-Stanley Bounds for Network Reliability

✍ Scribed by Jason I. Brown, Charles J. Colbourn

Book ID: 114421628
Publisher: Springer
Year: 1996
Tongue: English
Weight: 855 KB
Volume: 5
Category: Article
ISSN: 0925-9899
DOI: 10.1023/a:1022484229443

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Non-Stanley bounds for network reliabili

Non-Stanley bounds for network reliability

✍ Jason I. Brown, Charles J. Colbourn 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 930 KB

The Leggett bounds for network reliabili

The Leggett bounds for network reliability

✍ Harms, D.; Colbourn, C. 📂 Article 📅 1985 🏛 IEEE ⚖ 365 KB

Multiplicative improvements in network r

Multiplicative improvements in network reliability bounds

✍ Timothy B. Brecht; Charles J. Colbourn 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

Multiplicative inequalities for reliability bounds are derived, by observing that certain reliability measures are positively correlated. These inequalities can be used to obtain substantial improvements on available bounds for network reliability. ## 1. BACKGROUND AND MOTIVATION In the network de

Bounding algorithms for two-terminal net

Bounding algorithms for two-terminal network reliability

✍ G. Thangamani 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 418 KB

Network s-t reliability bounds using a 2

Network s-t reliability bounds using a 2-dimensional reliability polynomial

✍ Bulka, D.; Dugan, J.B. 📂 Article 📅 1994 🏛 IEEE 🌐 English ⚖ 644 KB

Improving reliability bounds in computer

Improving reliability bounds in computer networks

✍ Timothy B. Brecht; Charles J. Colbourn 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

The probability that a computer network is operational in an environment of statistically independent link failures has been widely studied. Three natural problems arise, when all nodes are to be connected (all-terminal reliability), when two nodes are to communicate (2-terminal reliability), and wh