Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition

DOI10.1016/j.ins.2017.09.020zbMath1436.68239OpenAlexW2753825475MaRDI QIDQ781014

Amitava Datta, Andrew Gozzard, Max Ward

Publication date: 16 July 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2017.09.020

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Network structure optimization for social networks by minimizing the average path length ⋮ A new coupled disease-awareness spreading model with mass media on multiplex networks

Cites Work

• Unnamed Item
• A zoom-in approach to design SDH mesh restorable networks
• Deterministic small-world networks
• Deterministic scale-free small-world networks of arbitrary order
• Minimizing Average Shortest Path Distances via Shortcut Edge Addition
• The Structure and Function of Complex Networks
• Collective dynamics of ‘small-world’ networks