Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2014, Article ID 154172, 6 pages
http://dx.doi.org/10.1155/2014/154172
Research Article

A Multilevel Simplification Algorithm for Computing the Average Shortest-Path Length of Scale-Free Complex Network

1Department of Electronic Information and Electric Engineering, Changzhou Institute of Technology, Changzhou 213002, China
2Business School, University of Shanghai for Science and Technology, Shanghai 200093, China

Received 20 March 2014; Accepted 18 May 2014; Published 2 June 2014

Academic Editor: Roberto Barrio

Copyright © 2014 Guoyong Mao and Ning Zhang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. R. Albert, H. Jeong, and A.-L. Barabási, “Diameter of the world-wide web,” Nature, vol. 401, no. 6749, pp. 130–131, 1999. View at Publisher · View at Google Scholar · View at Scopus
  2. A.-L. Barabási and R. Albert, “Emergence of scaling in random networks,” Science, vol. 286, no. 5439, pp. 509–512, 1999. View at Publisher · View at Google Scholar · View at Scopus
  3. R. Albert and A.-L. Barabási, “Statistical mechanics of complex networks,” Reviews of Modern Physics, vol. 74, no. 1, pp. 47–91, 2002. View at Publisher · View at Google Scholar · View at Scopus
  4. D. J. Watts and S. H. Strogatz, “Collective dynamics of “small-world” networks,” Nature, vol. 393, no. 6684, pp. 440–442, 1998. View at Publisher · View at Google Scholar · View at Scopus
  5. A.-L. Barabási, R. Albert, and H. Jeong, “Mean-field theory for scale-free random networks,” Physica A: Statistical Mechanics and Its Applications, vol. 272, no. 1, pp. 173–187, 1999. View at Publisher · View at Google Scholar · View at Scopus
  6. X. F. Wang and G. Chen, “Complex networks: small-world, scale-free and beyond,” IEEE Circuits and Systems Magazine, vol. 3, no. 1, pp. 6–20, 2003. View at Publisher · View at Google Scholar · View at Scopus
  7. E. W. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, no. 1, pp. 269–271, 1959. View at Publisher · View at Google Scholar · View at Scopus
  8. K. Madduri, D. A. Bader, W. B. Jonathan, and J. R. Crobak, “An experimental study of a parallel shortest path algorithm for solving large-scale graph instances,” in Proceedings of the 9th Workshop on Algorithm Engineering and Experiments, pp. 23–35, New Orleans, La, USA, January 2007. View at Scopus
  9. G. Mao and N. Zhang, “Analysis of average shortest-path length of scale-free network,” Journal of Applied Mathematics, vol. 2013, Article ID 865643, 5 pages, 2013. View at Publisher · View at Google Scholar · View at Scopus
  10. N. Zhang, “Demonstration of complex network: CERNET,” Journal of Systems Engineering, vol. 21, no. 4, pp. 337–340, 2006. View at Google Scholar
  11. G. Mao and N. Zhang, “Study of evolution model of China education and research network,” Mathematical Problem in Engineering, vol. 2013, Article ID 808901, 6 pages, 2013. View at Publisher · View at Google Scholar