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
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
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.