most citedEfficient routing on complex networks

636 citations · 656 across the 7 of their papers we have counts for

collaborators

7 papers

nlin.AO20056 cited

Generalized BBV Models for Weighted Complex Networks

Bo Hu, Gang Yan, Wen-Xu Wang +1

We will introduce two evolving models that characterize weighted complex networks. Though the microscopic dynamics are different, these models are found to bear a similar mathemati…

cond-mat.dis-nn2005

Weighted Network Models Based on Local and Global Rules

Bo Hu, Gang Yan, Wen-Xu Wang +1

We will introduce two evolving models that characterize weighted complex networks. Though the microscopic dynamics are different, these models are found to bear a similar mathemati…

cond-mat.stat-mech20054 cited

Simplex triangulation induced scale-free networks

Zhi-Ming Gu, Tao Zhou, Bing-Hong Wang +3

We propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called simplex triangulation…

cond-mat.dis-nn2005636 cited

Efficient routing on complex networks

Gang Yan, Tao Zhou, Bo Hu +2

In this letter, we propose a new routing strategy to improve the transportation efficiency on complex networks. Instead of using the routing strategy for shortest path, we give a g…

cond-mat.dis-nn20048 cited

Random Apollonian Networks

Tao Zhou, Gang Yan, Pei-Ling Zhou +2

In this letter, we propose a simple rule that generates scale-free networks with very large clustering coefficient and very small average distance. These networks are called {\bf R…

cond-mat.stat-mech20041 cited

Self-Organization Induced Scale-Free Networks

Gang Yan, Tao Zhou, Ying-Di Jin +1

What is the underlying mechanism leading to power-law degree distributions of many natural and artificial networks is still at issue. We consider that scale-free networks emerges f…