In this section we evaluate and compare the performances of the different methods and quality functions introduced in this paper. Comparing community detection results is a difficult task because one needs some test graphs whose community structure is already known. A classical approach is to use randomly generated graphs with communities. We will compare the partitions obtained by post-processing the results of the same agglomerative algorithm [1]}, [2]} on a large set of such graphs.
