Lehnerer, SimonBecker, Michael2019-10-142019-10-142018978-3-88579-448-6https://dl.gi.de/handle/20.500.12116/28981Detecting the community structure is of great interest when analyzing the topology of a network, however it is not a trivial problem. In this article a genetic algorithm is proposed which Ąnds the community structure of a network based on the maximization of a quality function called modularity. Tests using several sample networks show that it reliably Ąnds the community structure. However it does not resolve sufficiently small communities as intuitively expected due to an effect known as resolution limit.encomplex networkscommunity detectiongenetic algorithmText/Conference Paper1614-3213