  A new method for community identification is proposed which is founded on the
analysis of successive neighborhoods, reached through hierarchical growth from
a starting vertex, and on the definition of communities as a subgraph whose
number of inner connections is larger than outer connections. In order to
determine the precision and speed of the method, it is compared with one of the
most popular community identification approaches, namely Girvan and Newman's
algorithm. Although the hierarchical growth method is not as precise as Girvan
and Newman's method, it is potentially faster than most community finding
algorithms.
