Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 874217, 12 pages
http://dx.doi.org/10.1155/2014/874217
Research Article

An Efficient Hierarchy Algorithm for Community Detection in Complex Networks

1College of Computer and Information Engineering, Hohai University, Nanjing 211100, China
2Arts and Science, Ohio University Southern, Ironton, OH, USA

Received 31 March 2014; Revised 19 July 2014; Accepted 14 September 2014; Published 23 October 2014

Academic Editor: Ren-Jieh Kuo

Copyright © 2014 Lili Zhang et al. 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. A. L. Barabási and E. Bonabeau, “Scale-freenetworks,” Scientic American, vol. 288, no. 5, p. 60, 2003. View at Google Scholar
  2. A. L. Barabási and R. E. Crandall, “Linked: the new science of networks,” American Journal of Physics, vol. 71, p. 409, 2003. View at Google Scholar
  3. M. Girvan and M. E. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 99, no. 12, pp. 7821–7826, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. M. E. J. Newman, “Modularity and community structure in networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 103, no. 23, pp. 8577–8582, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. S. Wasserman and K. Faust, Social Network Analysis: Methods and Applications, Cambridge University Press, Cambridge, UK, 1994.
  6. G. Palla, I. Derényi, I. Farkas, and T. Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,” Nature, vol. 435, no. 7043, pp. 814–818, 2005. View at Publisher · View at Google Scholar · View at Scopus
  7. J. M. Kleinberg, “Authoritative sources in a hyperlinked environment,” Journal of the ACM, vol. 46, no. 5, pp. 604–632, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. R. B. Almeida and V. A. F. Almeida, “A community-aware search engine,” in Proceedings of the 13th Conference on the International World Wide Web Conference, S. I. Feldman, M. Uretsky, M. Najork, and C. E. Wills, Eds., pp. 413–421, ACM, New York, NY, USA, 2004.
  9. A. Sidiropoulos, G. Pallis, D. Katsaros, K. Stamos, A. Vakali, and Y. Manolopoulos, “Prefetching in content distribution networks via Web communities identification and outsourcing,” World Wide Web, vol. 11, no. 1, pp. 39–70, 2008. View at Publisher · View at Google Scholar · View at Scopus
  10. S. Fortunato, “Community detection in graphs,” Physics Reports, vol. 486, no. 3–5, pp. 75–174, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. B. W. Kernighan and S. Lin, “A efficient heuristic procedure for partitioning graphs,” Bell System Technical Journal, vol. 49, pp. 291–307, 1970. View at Google Scholar
  12. L. Donetti and M. A. Munoz, “Improved spectral algorithm for the detection of network communities,” in Proceedings of the 8th International Conference on Modeling Cooperative Behavior in the Social Sciences, P. L. Garrido, M. A. Muñoz, and J. Marro, Eds., vol. 779, pp. 104–107, American Institute of Physics, New York, NY, USA, 2005.
  13. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, NY, USA, 1990.
  14. A. V. Goldberg, “Recent developments in maximum flow algorithms,” in Algorithm Theory—SWAT'98, S. Arnborg and L. Ivansson, Eds., vol. 1432 of Lecture Notes in Computer Science, pp. 1–10, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar
  15. M. E. J. Newman, “Fast algorithm for detecting community structure in networks,” Physical Review E, vol. 69, no. 6, Article ID 066133, 2004. View at Publisher · View at Google Scholar · View at Scopus
  16. C. Q. Zhang, “Cycles of given length in some K1,3-free graphs,” Discrete Mathematics, vol. 78, no. 3, pp. 307–313, 1989. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  17. K. Makino and T. Uno, “New algorithms for enumerating all maximal cliques,” in Algorithm Theory: SWAT 2004, vol. 3111 of Lecture Notes in Computer Science, pp. 260–272, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. D. S. Bassett, M. A. Porter, N. F. Wymbs, S. T. Grafton, J. M. Carlson, and P. J. Mucha, “Robust detection of dynamic community structure in networks,” Chaos, vol. 23, no. 1, Article ID 013142, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Capocci, V. Sevedio, G. Caldarelli, and F. Colaiori, “Detecting communities in large networks,” in Algorithms and Models for the Web-Graph, vol. 3243 of Lecture Notes in Computer Science, pp. 181–187, Springer, Berlin, Germany, 2004. View at Google Scholar
  20. B. Yang, D.-Y. Liu, J. Liu, D. Jin, and H.-B. Ma, “Complex network clustering algorithms,” Journal of Software, vol. 20, no. 1, pp. 54–66, 2009. View at Publisher · View at Google Scholar · View at Scopus