  In the last decade the broad scope of complex networks has led to a rapid
progress. In this area a particular interest has the study of community
structures. The analysis of this type of structure requires the formalization
of the intuitive concept of community and the definition of indices of goodness
for the obtained results. A lot of algorithms has been presented to reach this
goal. In particular, an interesting problem is the search of overlapped
communities and it is field seems very interesting a solution based on the use
of genetic algorithms. The approach discusses in this paper is based on a
parallel implementation of a genetic algorithm and shows the performance
benefits of this solution.
