Analysis of Average Shortest-Path Length of Scale-Free Network
暂无分享,去创建一个
[1] P. Erdos,et al. On the evolution of random graphs , 1984 .
[2] Ma Liang. A New Approximation Algorithm for Finding Shortest-path in Large Networks , 2008 .
[3] Bin Wu,et al. Distance Distribution and Average Shortest Path Length Estimation in Real-World Networks , 2010, ADMA.
[4] Aristides Gionis,et al. Fast shortest path distance estimation in large networks , 2009, CIKM.
[5] David A. Bader,et al. An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances , 2007, ALENEX.
[6] Josef Stoer,et al. Numerische Mathematik 1 , 1989 .
[7] Kurt Mehlhorn,et al. A Parallelization of Dijkstra's Shortest Path Algorithm , 1998, MFCS.
[8] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[9] Adilson E. Motter,et al. Networks in Motion , 2012, ArXiv.
[10] Albert,et al. Emergence of scaling in random networks , 1999, Science.
[11] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[12] Albert-László Barabási,et al. Internet: Diameter of the World-Wide Web , 1999, Nature.
[13] B. Bollobás. The evolution of random graphs , 1984 .
[14] Guanrong Chen,et al. Complex networks: small-world, scale-free and beyond , 2003 .
[15] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[16] Jesper Larsson Träff,et al. A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs , 1996, IRREGULAR.
[17] Zhang Ning. Analysis of China Education Network Structure , 2007 .
[18] Gerhard Weikum,et al. Fast and accurate estimation of shortest paths in large graphs , 2010, CIKM.
[19] Reka Albert,et al. Mean-field theory for scale-free random networks , 1999 .