✦ LIBER ✦

Two Algorithms for Determining the Most Reliable Path of a Network

✍ Scribed by Petrovic, Radivoj; Jovanovic, Slobodan

Book ID: 117933942
Publisher: IEEE
Year: 1979
Tongue: English
Weight: 781 KB
Volume: R-28
Category: Article
ISSN: 0018-9529
DOI: 10.1109/tr.1979.5220514

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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 determining the most re

An algorithm for determining the most reliable path of a network

✍ V.K. Jain; Krishna Gopal 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 156 KB

Determination of the most reliable path

Determination of the most reliable path of a planar flow network

✍ Dong Wha Lee; Bong Jin Yum 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 406 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

Algorithms for the quickest path problem

Algorithms for the quickest path problem and the reliable quickest path problem

✍ Herminia I. Calvete; Lourdes del-Pozo; José A. Iranzo 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 260 KB

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