✦ LIBER ✦

Bounding algorithms for two-terminal network reliability

✍ Scribed by G. Thangamani

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 418 KB
Volume: 34
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(94)90062-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounding all-terminal reliability in com

Bounding all-terminal reliability in computer networks

✍ Charles J. Colbourn; Daryl D. Harms 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 645 KB

Polynomial algorithms for estimating net

Polynomial algorithms for estimating network reliability

✍ Eitan Zemel 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 751 KB

## Abstract We consider the problem of calculating the best possible bounds on the reliability of a system given limited information about the joint density function of its components. We show that a polynomial algorithm for this problem exists iff such an algorithm exists for a certain related pro

Triconnected decomposition for computing

Triconnected decomposition for computing K-terminal network reliability

✍ R. Kevin Wood 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 890 KB

Algorithms for K-terminal reliability pr

Algorithms for K-terminal reliability problems with node failures

✍ Ehab S. Elmallah 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 896 KB

A factoring algorithm using polygon-to-c

A factoring algorithm using polygon-to-chain reductions for computing K-terminal network reliability

✍ R. Kevin Wood 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 969 KB

A new algorithm for network system relia

A new algorithm for network system reliability

✍ Hua Cheng Chen; Ding Hua Shi; Wen Xin Xu 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 340 KB