A new algorithm for finding the communities surrounding a given node

Excepting Wu_Huberman algorithm, most existing community detection methods cannot allow for finding the particular communities to which a specified vertex belongs; however, Wu-Huberman algorithm need to know in advance that how many communities should be divided and then it cannot automatically detect an underlying community structure. According to divisive methods for finding a community structure based on edge betweenness measure, a new algorithm is presented to solve this problem. This new algorithm not only can speed up the betweenness calculation, but also can allow for automatically discovering the underlying communities surrounding a given node without having to find all communities of a graph.