A scoring mechanism for the rank aggregation of network robustness
From MaRDI portal
Publication:2257422
Recommendations
- Network robustness and random processes
- Multi-objective optimization to improve robustness in networks
- A unified network performance measure with importance identification and the ranking of network components
- scientific article; zbMATH DE number 5927562
- A review on network robustness from an information theory perspective
Cites work
- A survey of some network reliability analysis and synthesis results
- Emergence of Scaling in Random Networks
- Exploring complex networks
- Graph theory
- Graphs \& digraphs
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- scientific article; zbMATH DE number 3049708 (Why is no real title available?)
- Making Sense of Data
- Multiscale vulnerability of complex networks
- Network flows. Theory, algorithms, and applications.
- Network robustness to targeted attacks. The interplay of expansibility and degree distribution
- Networks. An introduction.
- Optimal network topologies: expanders, cages, Ramanujan graphs, entangled networks and all that
- The Structure and Function of Complex Networks
- Two algorithms for constructing a Delaunay triangulation
- Vulnerability of complex networks
- Who's \#1? The science of rating and ranking
This page was built for publication: A scoring mechanism for the rank aggregation of network robustness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2257422)