Universal Reliability Bounds for Sparse Networks
Consider a graph with perfect nodes and edges subject to independent random failures with identical probability.The all-terminal reliability (ATR) is the probability that the resulting subgraph is connected. First, we fully characterize uniformly least reliable graphs (ULRG) whose co-rank is not gre...
Zapisane w:
| 1. autor: | |
|---|---|
| Format: | article |
| Język: | angielski |
| Wydane: |
2021
|
| Hasła przedmiotowe: | |
| Dostęp online: | https://hdl.handle.net/20.500.12381/648 |
| Etykiety: |
Nie ma etykietki, Dołącz pierwszą etykiete!
|
Podobne zapisy: Universal Reliability Bounds for Sparse Networks
- Uniformly Optimally Reliable Graphs: A Survey
- A Simple Proof of the Gross-Saccoman Multigraph Conjecture
- The Gross-Saccoman Conjecture is True
- GRASP/VND Optimization Algorithms for Hard Combinatorial Problems
- Diameter-constrained reliability : theory and applications
- Domination Invariant of a Diameter Constrained Network Reliability Model