Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition
type: Item
instance of: scholarly article
title: Converting a network into a small-world network: fast algorithms for minimizing average path length through link addition
zbMATH Open document ID: 1436.68239
author: Andrew Gozzard
author: Max Ward
author: Amitava Datta
published in: Information Sciences
publication date: 2020-07-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C82
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 7221605
MaRDI profile type: Publication
full work available at URL: j.ins.2017.09.020
OpenAlex ID: W2753825475
cites work: Deterministic small-world networks
cites work: Introduction to algorithms
cites work: Minimizing Average Shortest Path Distances via Shortcut Edge Addition
cites work: The Structure and Function of Complex Networks
cites work: A zoom-in approach to design SDH mesh restorable networks
cites work: Collective dynamics of ‘small-world’ networks
cites work: Deterministic scale-free small-world networks of arbitrary order
DOI: 10.1016/J.INS.2017.09.020
description: scientific article; zbMATH DE number 7221605