Trade-offs between density and robustness in random interconnection graphs
From MaRDI portal
Recommendations
- On the robustness of interconnections in random graphs: a symbolic approach.
- Robustness and Vulnerability of Scale-Free Random Graphs
- Short vertex disjoint paths and multiconnectivity in random graphs: reliable network computing
- Connectivity properties in random regular graphs with edge faults
- scientific article; zbMATH DE number 3884207
Cited in
(8)- On the robustness of interconnections in random graphs: a symbolic approach.
- Robustness: a new form of heredity motivated by dynamic networks
- Robustness of random graphs based on graph spectra
- Robustness and Vulnerability of Scale-Free Random Graphs
- Characterization of robustness and resilience in graphs: a mini-review
- The impact of edge correlations in random networks
- On Connectivity and Robustness in Random Intersection Graphs
- Percolation thresholds for robust network connectivity
This page was built for publication: Trade-offs between density and robustness in random interconnection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536423)