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

On reliability of graphs with node failures

โœ Scribed by Olivier Goldschmidt; Patrick Jaillet; Richard Lasota

Publisher
John Wiley and Sons
Year
1994
Tongue
English
Weight
649 KB
Volume
24
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Network reliability with node failures
Network reliability with node failures
โœ Liu, Shaobin; Cheng, Kam-Hoi; Liu, Xiaoping ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 101 KB

Given a graph whose edges never fail but whose nodes fail independently of each other with a constant probability 1 ---p p p, the reliability of a graph is defined to be the probability that the induced subgraph of the surviving nodes is connected. Let โ„ฆ (n n n, m m m) be the class of all graphs wit

A model of storage reliability with poss
A model of storage reliability with possible initial failures
โœ M. Zhao; M. Xie ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 378 KB

Recently, storage reliability has attracted attention because of the increasing demand for high reliability of products in storage in both military and commercial industries. In this paper we study a general storage reliability model for the analysis of storage failure data. It is indicated that the

Resilience of partial k-tree networks wi
Resilience of partial k-tree networks with edge and node failures
โœ Erick Mata-Montero ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 965 KB

The resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network is a #P-complete problem even for planar networks with fail-safe nodes. We generalize an O(n\*) time algorithm to compute the resilience of n-node k-tree networks with fai