Computer Science – Information Retrieval
Scientific paper
2009-12-04
International Journal of Computer Science and Information Security, IJCSIS, Vol. 6, No. 2, pp. 113-118, November 2009, USA
Computer Science
Information Retrieval
6 pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS November 2009, ISSN 1947 5500,
Scientific paper
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.
Carchiolo Vincenza
Longheu Alessandro
Malgeri Michele
Mangioni Giuseppe
No associations
LandOfFree
Search for overlapped communities by parallel genetic algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Search for overlapped communities by parallel genetic algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Search for overlapped communities by parallel genetic algorithms will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-706316