A characteristic feature of many relevant real life networks, like the WWW, Internet, transportation
and communication networks, or even biological and social networks, is their
clustering structure. We discuss in this paper a novel algorithm to identify cluster sets of
densely interconnected nodes in a network. The algorithm is based on local information
and therefore it is very fast with respect other proposed methods, while it keeps a similar
performance in detecting the clusters.