A. Cuesta, F. , G. Sequeiros, P. , L. Rojo et al., Exploring the topological sources of robustness against invasion in biological and technological networks, Scientific Reports, vol.6, 2016.

A. Barabasi and Z. Oltvai, Network biology: understanding the cell's functional organization, Nature Reviews Genetics, vol.184, issue.2, pp.101-113, 2004.
DOI : 10.1128/JB.184.1.152-164.2002

V. Batagelj and M. Zaversnik, An O(m) Algorithm for Cores Decomposition of Networks, Preprint, vol.5, pp.129-145, 2002.

S. Boccaletti, V. Latora, Y. Moreno, M. Chavez, and D. Hwang, Complex networks: Structure and dynamics, Physics Reports, vol.424, issue.4-5, pp.175-308, 2006.
DOI : 10.1016/j.physrep.2005.10.009

L. Brunet-a, A. Jm, . Jm, and M. Courtney, Method of identification of a relationship between biological elements, p.779, 2015.

T. Cormen, C. Leiserson, R. Rivest, and C. S. , Introduction to Algorithms, 2001.

M. Cysouw, R function cor.sparse, pp.2018-2020, 2018.

D. Eddelbuettel and R. François, Rcpp: Seamless R and C++ Integration, Journal of Statistical Software, vol.40, issue.8, pp.1-18, 2011.
DOI : 10.1007/978-1-4614-6868-4
URL : https://www.jstatsoft.org/index.php/jss/article/view/v040i08/v40i08.pdf

C. Giatsidis, F. Malliaros, N. Tziortziotis, C. Dhanjal, A. Kiagias et al., A k-core Decomposition Framework for Graph Clustering, 2016.

B. Kernighan and S. Lin, An Efficient Heuristic Procedure for Partitioning Graphs, Bell System Technical Journal, vol.49, issue.2, pp.291-307, 1970.
DOI : 10.1002/j.1538-7305.1970.tb01770.x

J. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society, vol.7, issue.1, pp.48-50, 1956.
DOI : 10.1090/S0002-9939-1956-0078686-7
URL : http://www.ams.org/proc/1956-007-01/S0002-9939-1956-0078686-7/S0002-9939-1956-0078686-7.pdf

M. Maechler, https://www.rdocumentation. org/packages, R package Matrix, vol.1, pp.2-12, 2017.

M. Newman, Detecting community structure in networks, The European Physical Journal B - Condensed Matter, vol.38, issue.2, pp.321-330, 2004.
DOI : 10.1140/epjb/e2004-00124-y

M. Newman, Fast algorithm for detecting community structure in networks, Physical Review E, vol.33, issue.6, p.69, 2004.
DOI : 10.1098/rsbl.2003.0057
URL : http://arxiv.org/pdf/cond-mat/0309508

M. Newman, Networks: An Introduction, 2009.
DOI : 10.1093/acprof:oso/9780199206650.001.0001

M. Newman and M. Girvan, Finding and evaluating community structure in networks, Physical Review E, vol.65, issue.2, p.15, 2004.
DOI : 10.1103/PhysRevE.68.065103
URL : http://arxiv.org/pdf/cond-mat/0308217

K. Randall, Cilk: Efficient Multithreaded Computing, 1998.

S. Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.
DOI : 10.1016/j.cosrev.2007.05.001

S. Seidman, Network structure and minimum degree, Social Networks, vol.5, issue.3, pp.269-287, 1983.
DOI : 10.1016/0378-8733(83)90028-X

P. Spellman, G. Sherlock, M. Zhang, I. Vishwanath, K. Anders et al., by Microarray Hybridization, Molecular Biology of the Cell, vol.133, issue.12, pp.3273-3297, 1998.
DOI : 10.1083/jcb.133.1.99

J. Steele, Minimal Spanning Trees for Graphs with Random Edge Lengths, Mathematics and Computer Science II, pp.223-245, 2002.
DOI : 10.1007/978-3-0348-8211-8_14
URL : https://repository.upenn.edu/cgi/viewcontent.cgi?article=1233&context=oid_papers

R. Tarjan, Depth first search and linear graph algorithms, SIAM JOURNAL ON COMPUTING, vol.1, issue.2, 1972.
DOI : 10.1137/0201010
URL : http://www.csee.wvu.edu/~xinl/library/papers/comp/Tarjan_siam1972.pdf

R. Team, R package stats, 2015.

T. Tibshirani and J. Friedman, The Elements of Statistical Learning, Between Data Science and Applied Data Analysis, 2001.

V. Luxburg and U. , A tutorial on spectral clustering, Statistics and Computing, vol.21, issue.1, pp.395-416, 2007.
DOI : 10.1017/CBO9780511810633

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

B. Zan and C. Noon, Shortest Path Algorithms: An Evaluation Using Real Road Networks, Transportation Science, vol.32, issue.1, pp.65-73, 1998.
DOI : 10.1287/trsc.32.1.65