𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear-time approximation method for computing the reliability of a network

✍ Scribed by Steve G Belovich; Vijaya K Konangi


Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
541 KB
Volume
21
Category
Article
ISSN
0169-7552

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Linear time algorithms for computing the
✍ 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

A computational method for finding the z
✍ E.J. Davison πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 299 KB

calculating the zeros of the transfer function which exists between an input and output of an arbitrary multivariable linear time invariant systemβ€’ The method is simple to use; is computationally fast and is accurate. Some numerical examples for a 9th order system are included.