A New Efficient Algorithm for Detecting Communities in Complex Networks

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.