Optimization of the critical diameter and average path length of social networks
From MaRDI portal
Publication:2012776
DOI10.1155/2017/3203615zbMath1367.91155OpenAlexW2598554365WikidataQ59142881 ScholiaQ59142881MaRDI QIDQ2012776
Wei Du, Haifeng Du, Xiaochen He, Marcus W. Feldman
Publication date: 3 August 2017
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/3203615
Related Items
Cites Work
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- Scale-Free Networks: A Decade and Beyond
- Minimizing the Diameter of a Network Using Shortcut Edges
- Minimizing Average Shortest Path Distances via Shortcut Edge Addition
- Design to Minimize Diameter on Building-Block Network
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Reduction of Average Path Length in Binary Decision Diagrams by Spectral Methods
- Collective dynamics of ‘small-world’ networks