๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The most reliable series-parallel networks

โœ Scribed by Eric M. Neufeld; Charles J. Colbourn

Publisher
John Wiley and Sons
Year
1985
Tongue
English
Weight
333 KB
Volume
15
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The most likely path on series-parallel
The most likely path on series-parallel networks
โœ Daniel Reich; Leo Lopes ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 281 KB

## Abstract In this article, we present a stochastic shortest path problem that we refer to as the Most Likely Path Problem (MLPP). We demonstrate that optimal solutions to the MLPP are not composed of optimal subpaths, which limits the computational tractability of exact solution methods. On serie

Exact reliabilities of most reliable dou
Exact reliabilities of most reliable double-loop networks
โœ Hwang, Frank K.; Wright, Paul E.; Hu, X. D. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 162 KB

A double-loop network with hop constants h 1 , h 2 , DL(n, h 1 , h 2 ) may be represented as a directed graph with n nodes 0, 1, . . . , n 0 1 and 2n links of the form i r i / h 1 mod n and i r i / h 2 mod n (referred to as h 1 -links and h 2 -links). They have been proposed as architectures for loc

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