✦ LIBER ✦

Parallel algorithms for terminal-pair reliability

✍ Scribed by Deo, N.; Medidi, M.

Book ID: 114555132
Publisher: IEEE
Year: 1992
Tongue: English
Weight: 838 KB
Volume: 41
Category: Article
ISSN: 0018-9529
DOI: 10.1109/24.257782

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for terminal-pair re

Parallel algorithms for terminal-pair reliability : Narsingh Deo and Muralidhar Medidi. IEEE Transactions on Reliability41(2), 201 (1992)

📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 222 KB

A comparison of algorithms for terminal-

A comparison of algorithms for terminal-pair reliability

✍ Yoo, Y.B.; Deo, N. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 470 KB

Bounding algorithms for two-terminal net

Bounding algorithms for two-terminal network reliability

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

A cut-based method for terminal-pair rel

A cut-based method for terminal-pair reliability

✍ Chen, Y.G.; Yuang, M.C. 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 485 KB

Termination Detection for Parallel Short

Termination Detection for Parallel Shortest Path Algorithms

✍ Michelle R Hribar; Valerie E Taylor; David E Boyce 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Shortest path computation is required by a large number of applications such as VLSI, transportation, and communication networks. These applications, which are often very complex and have sparse networks, generally use parallel labeling shortest path algorithms. Such algorithms, when implemented on

Terminal-pair reliability of network sys

Terminal-pair reliability of network system using flow augmenting path search algorithm

✍ Moon Soo Choi; Chi-Hyuck Jun 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 543 KB