R. 1. Przulj, Graph theory approaches to protein interaction data analysis, p.0, 2003.

C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, pp.575-577, 1973.
DOI : 10.1145/362342.362367

E. Tomita, A. Tanaka, and H. Takahashi, The worst-case time complexity for generating all maximal cliques and computational experiments, Theoretical Computer Science, vol.363, issue.1, pp.28-42, 2006.
DOI : 10.1016/j.tcs.2006.06.015

P. Prosser, Exact Algorithms for Maximum Clique: A Computational Study??, Algorithms, vol.5, issue.4, pp.545-587, 2012.
DOI : 10.3390/a5040545

R. M. Karp, Reducibility among combinatorial problems, 1972.

R. Samudrala and J. Moult, A graph-theoretic algorithm for comparative modeling of protein structure, Journal of Molecular Biology, vol.279, issue.1, pp.287-302, 1998.
DOI : 10.1006/jmbi.1998.1689

Z. Prihar, Topological Properties of Telecommunication Networks, Proceedings of the IRE, vol.44, issue.7, pp.927-933, 1956.
DOI : 10.1109/JRPROC.1956.275149

F. Zhou, Graph compression Department of Computer Science and Helsinki Institute for Information Technology HIIT, pp.1-12

M. Adler and M. Mitzenmacher, Towards compressing Web graphs, Proceedings DCC 2001. Data Compression Conference, pp.203-212, 2001.
DOI : 10.1109/DCC.2001.917151

Y. Tian, R. A. Hankins, and J. M. Patel, Efficient aggregation for graph summarization, Proceedings of the 2008 ACM SIGMOD international conference on Management of data , SIGMOD '08, pp.567-580, 2008.
DOI : 10.1145/1376616.1376675

P. Boldi and S. Vigna, The webgraph framework I, Proceedings of the 13th conference on World Wide Web , WWW '04, pp.595-602, 2004.
DOI : 10.1145/988672.988752

H. Toivonen, F. Zhou, A. Hartikainen, and A. Hinkka, Compression of weighted graphs, Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '11, pp.965-973, 2011.
DOI : 10.1145/2020408.2020566

T. Gallai, Transitiv orientierbare Graphen, Acta Mathematica Academiae Scientiarum Hungaricae, vol.51, issue.1-2, pp.25-66, 1967.
DOI : 10.1007/BF02020961

R. M. Mcconnell and J. P. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, vol.201, issue.1-3, pp.189-241, 1999.
DOI : 10.1016/S0012-365X(98)00319-7

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.
DOI : 10.1016/j.cosrev.2010.01.001

D. Eppstein and D. Strash, Listing all maximal cliques in large sparse real-world graphs, Experimental Algorithms, pp.364-375, 2011.

V. Batagelj and M. Zaversnik, An o (m) algorithm for cores decomposition of networks, 2003.

J. Wang, J. Cheng, and A. W. Fu, Redundancy-aware maximal cliques, Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '13, pp.122-130, 2013.
DOI : 10.1145/2487575.2487689

B. Pattabiraman, M. M. Patwary, A. H. Gebremedhin, W. Liao, and A. Choudhary, Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs, Algorithms and Models for the Web Graph, pp.156-169, 2013.
DOI : 10.1007/978-3-319-03536-9_13

C. Capelle, M. Habib, and F. De-montgolfier, Graph decompositions and factorizing permutations, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp.55-70, 2002.
DOI : 10.1109/ISTCS.1997.595165
URL : https://hal.archives-ouvertes.fr/hal-00958972

C. Capelle, Decompositions de graphes et permutations factorisantes, 1997.

M. Habib, C. Paul, and L. Viennot, PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.147-170, 1999.
DOI : 10.1142/S0129054199000125

A. Bergeron, C. Chauve, F. De-montgolfier, and M. Raffinot, Permutations, with Applications to Modular Decomposition of Graphs, SIAM Journal on Discrete Mathematics, vol.22, issue.3, pp.1022-1039, 2008.
DOI : 10.1137/060651331
URL : https://hal.archives-ouvertes.fr/hal-00159580