S. Wasserman and K. Faust, Social Network Analysis, Methods and Applications, 1994.
DOI : 10.1017/CBO9780511815478

J. Gross and J. Yellen, Handbook of graph theory, Discrete mathematics and its applications, 2004.
DOI : 10.1201/9780203490204

X. S. Zhang, R. S. Wang, Y. Wang, J. Wang, Y. Qiu et al., Modularity optimization in community detection of complex networks, EPL (Europhysics Letters), vol.87, issue.3, p.38002, 2009.
DOI : 10.1209/0295-5075/87/38002

P. Chan, M. Schlag, and J. Zien, Spectral K-way ratio-cut partitioning and clustering, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.13, issue.9, p.1088, 1994.
DOI : 10.1109/43.310898

L. W. Hagen and A. B. Kahng, New spectral methods for ratio cut partitioning and clustering, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.11, issue.9, p.1074, 1992.
DOI : 10.1109/43.159993

M. Bolla, -means clustering, Physical Review E, vol.84, issue.1, p.16108, 2011.
DOI : 10.1103/PhysRevE.84.016108
URL : https://hal.archives-ouvertes.fr/in2p3-00356269

Z. Li, S. Zhang, R. Wang, X. Zhang, and L. Chen, Quantitative function for community detection, Physical Review E, vol.77, issue.3, p.36109, 2008.
DOI : 10.1103/PhysRevE.77.036109

Y. Hu, H. Chen, P. Zhang, M. Li, Z. Di et al., Comparative definition of community and corresponding identifying algorithm, Physical Review E, vol.78, issue.2, p.26121, 2008.
DOI : 10.1103/PhysRevE.78.026121

C. O. Dorso and A. D. Medus, COMMUNITY DETECTION IN NETWORKS, International Journal of Bifurcation and Chaos, vol.20, issue.02, p.361, 2010.
DOI : 10.1142/S0218127410025818

A. D. Medus and C. O. Dorso, Alternative approach to community detection in networks, Physical Review E, vol.79, issue.6, p.66111, 2009.
DOI : 10.1103/PhysRevE.79.066111

B. Ball, B. Karrer, and M. E. Newman, Efficient and principled method for detecting communities in networks, Physical Review E, vol.84, issue.3, p.36103, 2011.
DOI : 10.1103/PhysRevE.84.036103

V. A. Traag, P. Van-dooren, and Y. Nesterov, Narrow scope for resolution-limit-free community detection, Physical Review E, vol.84, issue.1, p.16114, 2011.
DOI : 10.1103/PhysRevE.84.016114

D. Aloise, S. Cafieri, G. Caporossi, P. Hansen, S. Perron et al., Column generation algorithms for exact modularity maximization in networks, Physical Review E, vol.82, issue.4, p.46112, 2010.
DOI : 10.1103/PhysRevE.82.046112
URL : https://hal.archives-ouvertes.fr/hal-00934661

K. H. Shafique, Partitioning a graph in alliances and its application to data clustering, 2004.

S. Cafieri, P. Hansen, and L. Liberti, Edge ratio and community structure in networks, Physical Review E, vol.81, issue.2, p.26105, 2010.
DOI : 10.1103/PhysRevE.81.026105
URL : https://hal.archives-ouvertes.fr/hal-00935207

D. Lusseau, K. Schneider, O. J. Boisseau, P. Haase, E. Slooten et al., The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations, Behavioral Ecology and Sociobiology, vol.54, issue.4, p.396, 2003.
DOI : 10.1007/s00265-003-0651-y

D. Medus and . Present-in, 4, a partitioning of the 62 dolphin dataset into five weak communities . The union of two of them and of the three others gives a bipartition of the set of dolphins into communities in the strong sense. It appears however that the dataset used by Medus and Dorso differs from the standard one of Lusseau (i.e., there are 157 edges instead of 159 and the number of vertices of equal degree differs in several places, Medus kindly applied his algorithm for strenght maximization subject to Radicchi strong condition to Lusseau standard network and obtained the same partition as we do

D. E. Knuth, The Stanford GraphBase: a platform for combinatorial computing, 1993.