Y. Ahn, J. P. Bagrow, and S. Lehmann, Link communities reveal multiscale complexity in networks, Nature, vol.80, issue.7307, pp.7307-761, 2010.
DOI : 10.1038/nature09182

R. Andersen, F. Chung, and K. Lang, Local Graph Partitioning using PageRank Vectors, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.475-486, 2006.
DOI : 10.1109/FOCS.2006.44

S. Cohen, B. Kimelfeld, and G. Koutrika, A Survey on Proximity Measures for Social Networks, Search computing, pp.191-206, 2012.
DOI : 10.1007/978-3-642-34213-4_13

M. Danisch, J. Guillaume, L. Grand, and B. , Learning a proximity measure to complete a community, 2014 International Conference on Data Science and Advanced Analytics (DSAA), 2014.
DOI : 10.1109/DSAA.2014.7058057
URL : https://hal.archives-ouvertes.fr/hal-01208519

M. Danisch, J. Guillaume, L. Grand, and B. , Towards multi-ego-centered communities: a node similarity approach, Int. J, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00823315

D. Eppstein, M. Löffler, and D. Strash, Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time, 2010.
DOI : 10.1007/978-3-642-17517-6_36

R. Kanawati, Seed-Centric Approaches for Community Detection in Complex Networks, Social computing and social media, pp.197-208, 2014.
DOI : 10.1007/978-3-319-07632-4_19

J. M. Kumpula, M. Kivelä, K. Kaski, and J. Saramäki, Sequential algorithm for fast clique percolation, Physical Review E, vol.78, issue.2, p.26109, 2008.
DOI : 10.1103/PhysRevE.78.026109

J. Leskovec, A. Rajaraman, and J. D. Ullman, Mining of massive datasets, 2014.
DOI : 10.1017/CBO9781139924801

F. D. Malliaros and M. Vazirgiannis, Clustering and community detection in directed networks: A survey, Physics Reports, vol.533, issue.4, pp.95-142, 2013.
DOI : 10.1016/j.physrep.2013.08.002

J. W. Moon and L. Moser, On cliques in graphs, Israel Journal of Mathematics, vol.3, issue.1, pp.23-28, 1965.
DOI : 10.1007/BF02760024

G. Palla, I. Derényi, I. Farkas, and T. Vicsek, Uncovering the overlapping community structure of complex networks in nature and society, Nature, vol.387, issue.7043, pp.7043-814, 2005.
DOI : 10.1038/nature03248

F. Reid, A. Mcdaid, and N. Hurley, Percolation Computation in Complex Networks, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, pp.274-281, 2012.
DOI : 10.1109/ASONAM.2012.54

J. J. Whang, D. F. Gleich, and I. S. Dhillon, Overlapping community detection using seed set expansion, Proceedings of the 22nd ACM international conference on Conference on information & knowledge management, CIKM '13, pp.2099-2108, 2013.
DOI : 10.1145/2505515.2505535

K. A. Wilson, N. D. Green, L. Agrawal, X. Gao, D. Madhusoodanan et al., Graphbased proximity measures. Practical Graph Mining with R, p.135, 2013.

J. Xie, S. Kelley, and B. K. Szymanski, Overlapping community detection in networks, ACM Computing Surveys, vol.45, issue.4, 2011.
DOI : 10.1145/2501654.2501657

J. Yang and J. Leskovec, Overlapping community detection at scale, Proceedings of the sixth ACM international conference on Web search and data mining, WSDM '13, pp.587-596, 2013.
DOI : 10.1145/2433396.2433471

J. Yang and J. Leskovec, Defining and evaluating network communities based on ground-truth, Knowledge and Information Systems, vol.393, issue.3, pp.181-213, 2015.
DOI : 10.1007/s10115-013-0693-z