✦ LIBER ✦

Fast computation of bounds for two-terminal network reliability

✍ Scribed by Sebastio, Stefano; Trivedi, Kishor S.; Wang, Dazhi; Yin, Xiaoyan

Book ID: 121810913
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 751 KB
Volume: 238
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2014.04.035

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounding algorithms for two-terminal net

Bounding algorithms for two-terminal network reliability

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

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

An algorithm for lower reliability bound

An algorithm for lower reliability bounds of multistate two-terminal networks

✍ Satitsatian, S.; Kapur, K.C. 📂 Article 📅 2006 🏛 IEEE 🌐 English ⚖ 251 KB

Computing terminal reliability of comput

Computing terminal reliability of computer network

✍ Suresh Rai; Arun Kumar; E.V. Prasad 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 372 KB

A network reduction axion for efficient

A network reduction axion for efficient computation of terminal-pair reliability

✍ S.J Hsu; M.C Yuang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 965 KB

Terminal-pair reliability (TR) in network management determines the probabilistic reliability between two nodes (the source and sink) of a network, given failure probabilities of all links. It has been shown that TR can be effectively computed by means of the network reduction technique. Existing re

Triconnected decomposition for computing

Triconnected decomposition for computing K-terminal network reliability

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