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

Optimizing reliability

โœ Scribed by George Lajtha


Book ID
107958008
Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
94 KB
Volume
7
Category
Article
ISSN
0308-5961

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Optimally reliable networks
โœ D. H. Smith ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Springer US ๐ŸŒ English โš– 427 KB
Uniformly optimally reliable graphs
โœ Gross, D.; Saccoman, J. T. ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 156 KB

A graph with n nodes and e edges, where the nodes are perfectly reliable and the edges fail independently with equal probability r, is said to be uniformly optimally reliable (UOR) if it has the greatest reliability among all graphs with the same number of nodes and edges for all values of r. UOR si