Community detection in graphs

Description
Detecting communities in graphs is crucial to uncover relationships between nodes of complex networks. We review the topic, from the main concepts and related problems to the description of some of the most popular algorithms. We close with a list of open problems of the field, from the issue of testing algorithms to the question of what structural communities stand for.
Organised by Vito Latora