✦ LIBER ✦

An algorithm for determining the most reliable path of a network

✍ Scribed by V.K. Jain; Krishna Gopal

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 156 KB
Volume: 26
Category: Article
ISSN: 0026-2714
DOI: 10.1016/0026-2714(86)90231-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for determining the shortes

An algorithm for determining the shortest path on a network graph

✍ S.M. Alekseeva; O.G. Alekseev 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 568 KB

Linear time algorithms for computing the

Linear time algorithms for computing the most reliable source on an unreliable tree network

✍ Xue, Guoliang 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

Given a tree network with n vertices where each edge has an operational probability, we are interested in finding a vertex on the tree whose expected number of reachable vertices is maximum. This problem was studied in Networks 27 (1996) 219-237, where an O(n 3 ) time algorithm and an O(n 2 ) time a

Two algorithms for determining the most

Two algorithms for determining the most reliable path of a network : Radivoj Petrovic and Slobadan Jovanovic. IEEE Trans. Reliab.R-28, (2) 115 (June 1979)

📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 128 KB

An Algorithm for finding the optimal pat

An Algorithm for finding the optimal path on a network with bans

✍ V.F. Krivorotov 📂 Article 📅 1975 🏛 Elsevier Science ⚖ 648 KB

A new formula and an algorithm for relia

A new formula and an algorithm for reliability analysis of networks

✍ Lian-Chang Zhao; Fan-Jia Kong 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 523 KB

An algorithm for enumerating all simple

An algorithm for enumerating all simple paths in a communication network

✍ R.B. Misra 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 235 KB