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

Resilience of partial k-tree networks with edge and node failures

โœ Scribed by Erick Mata-Montero

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
965 KB
Volume
21
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 fail-safe nodes to obtain an O(n) time algorithm that computes the resilience of n-node partial k-tree networks with edge and node failures (given a fixed k and an embedding of the partial k-tree in a k-tree).

๐Ÿ“œ SIMILAR VOLUMES

Optimal (ฯ„, T) opportunistic maintenance
Optimal (ฯ„, T) opportunistic maintenance of a k-out-of-n:G system with imperfect PM and partial failure
โœ Hoang Pham; Hongzhou Wang ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 149 KB ๐Ÿ‘ 1 views

The opportunistic maintenance of a k-out-of-n:G system with imperfect preventive maintenance (PM) is studied in this paper, where partial failure is allowed. In many applications, the optimal maintenance actions for one component often depend on the states of the other components and system reliabil