The Gross-Saccoman Conjecture is True
Consider a graph with perfect nodes but independent edge failures with identical probability ρ. The reliability is the connectedness probability of the random graph. A graph with n nodes and e edges is uniformly optimally reliable (UOR) if it has the greatest reliability among all graphs with the sa...
שמור ב:
| מחבר ראשי: | |
|---|---|
| פורמט: | article |
| שפה: | אנגלית |
| יצא לאור: |
2020
|
| נושאים: | |
| גישה מקוונת: | https://hdl.handle.net/20.500.12381/700 |
| תגים: |
אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!
|
פריטים דומים: The Gross-Saccoman Conjecture is True
- A Simple Proof of the Gross-Saccoman Multigraph Conjecture
- Universal Reliability Bounds for Sparse Networks
- Uniformly Optimally Reliable Graphs: A Survey
- Domination Invariant of a Diameter Constrained Network Reliability Model
- Diameter-constrained reliability : theory and applications
- Network reliability analysis and intractability of counting diameter crystal graphs