IMPROVED EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS

DOI10.1142/S0129183112500167zbMath1267.90033OpenAlexW2030472289MaRDI QIDQ4918284

Zhongyuan Jiang, Mangui Liang

Publication date: 24 April 2013

Published in: International Journal of Modern Physics C (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129183112500167

zbMATH Keywords

scale-free networkstraffic capacitybetweenness centralitytransport efficiencyimproved efficient routing

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Traffic problems in operations research (90B20)

Cites Work

• Finding good approximate vertex and edge partitions is NP-hard
• A genetic algorithm for the weight setting problem in OSPF routing
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Transport optimization on complex networks

This page was built for publication: IMPROVED EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS