Analysis of average shortest-path length of scale-free network

DOI10.1155/2013/865643zbMath1271.68107OpenAlexW2004699076WikidataQ59004973 ScholiaQ59004973MaRDI QIDQ364556

Ning Zhang, Guoyong Mao

Publication date: 9 September 2013

Published in: Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/865643

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Dynamic programming (90C39)

Related Items (1)

A multilevel simplification algorithm for computing the average shortest-path length of scale-free complex network

Uses Software

• Python
• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Collective dynamics of ‘small-world’ networks
• A simple parallel algorithm for the single-source shortest path problem on planar digraphs

This page was built for publication: Analysis of average shortest-path length of scale-free network