Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition
From MaRDI portal
(Redirected from Publication:781014)
Recommendations
- Network structure optimization for social networks by minimizing the average path length
- A low complexity method for the optimization of network path length in spatially embedded networks
- Optimization of the critical diameter and average path length of social networks
- Analyzing Kleinberg's (and other) small-world models
- Navigable small-world networks with few random bits
Cites work
- A zoom-in approach to design SDH mesh restorable networks
- Collective dynamics of `small-world' networks
- Deterministic scale-free small-world networks of arbitrary order
- Deterministic small-world networks
- Introduction to algorithms
- Minimizing Average Shortest Path Distances via Shortcut Edge Addition
- The Structure and Function of Complex Networks
Cited in
(5)- A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network
- A new coupled disease-awareness spreading model with mass media on multiplex networks
- Optimization of the critical diameter and average path length of social networks
- A low complexity method for the optimization of network path length in spatially embedded networks
- Network structure optimization for social networks by minimizing the average path length
This page was built for publication: Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q781014)