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

Building Edge-Failure Resilient Networks

โœ Scribed by Chandra Chekuri; A. Gupta; Amit Kumar; J. Naor; Danny Raz


Book ID
106148606
Publisher
Springer
Year
2005
Tongue
English
Weight
278 KB
Volume
43
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Resilience of partial k-tree networks wi
โœ 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

Optimizing complex networks for resilien
โœ J. Ash; D. Newth ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 667 KB

Our modern society has come to depend on large-scale infrastructure networks to deliver resources to our homes and businesses in an efficient manner. Over the past 10 years there have been numerous examples where a local disturbance has lead to the global failure of systems. In this paper, we use an

Network Resilience
โœ Colbourn, Charles J. ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Society for Industrial and Applied Mathematics โš– 856 KB
Resilient mounting systems in buildings
โœ R. Breeuwer; J.C. Tukker ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 965 KB