System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

A New Efficient Algorithm for Detecting Communities in Complex Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ying Wan ; Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol. of China, Chengdu ; Duanbing Chen ; Yan Fu

In this paper, we propose a new efficient algorithm which makes a good thing out of the betweenness centrality and the local information to detect community structures in complex networks. When being tested on some typical real world networks, our algorithm demonstrates excellent community partition results and very fast processing performance, much faster than the existing classical community detecting algorithms.

Published in:

Network and Parallel Computing, 2008. NPC 2008. IFIP International Conference on

Date of Conference:

18-21 Oct. 2008