A decomposition algorithm for network reliability evaluation
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Data Structures and Algorithms
Data Structures and Algorithms
On the characterization of the domination of a diameter-constrained network reliability model
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
Decomposing graph with 2-node cuts for diameter constrained network reliability calculation
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
We consider a network with unreliable communication channels and perfectly reliable nodes. The diameter constrained reliability for such a network is defined as the probability that between each pair of nodes, there exists a path consisting of operational edges whose number is upper bounded by a given integer. The problem of computing this characteristic is NP-hard, just like the problem of computing the probability of a network's connectivity. We propose a formula that lets one use junction points to compute the reliability of a two-pole system with diameter constraints, which makes the computations faster.