M. Adler, M. Et, and . Mitzenmacher, Towards compressing web graphs, Data Compression Conference, pp.203-212, 2001.

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

A. Bergeron, C. Chauve, F. D. Montgolfier, and E. M. Raffinot, Computing common intervals of k permutations, with applications to modular decomposition of graphs, SIAM Journal on Discrete Mathematics, vol.22, issue.3, pp.1022-1039, 2008.

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

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

C. Capelle, M. Habib, and F. De-montgolfier, Graph decompositions and factorizing permutations, Discrete Mathematics and Theoretical Computer Science, vol.5, issue.1, pp.55-70, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00958972

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

T. Gallai, Transitiv orientierbare graphen, Acta Mathematica Hungarica, vol.18, issue.1, pp.25-66, 1967.

J. Guo, S. Zhang, X. Gao, and E. X. Liu, Parallel graph partitioning framework for solving the maximum clique problem using hadoop, 2017 IEEE 2nd International Conference on, pp.186-192, 2017.

M. Habib, C. Et, and . Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.

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.

R. M. Mcconnell and J. P. Spinrad, Modular decomposition and transitive orientation, Discrete Mathematics, vol.201, issue.1, pp.189-241, 1999.

F. D. Montgolfier, Décomposition modulaire des graphes : théorie, extensions et algorithmes, vol.2, 2003.

P. Prosser, Exact algorithms for maximum clique : A computational study, Algorithms, vol.5, issue.4, pp.545-587, 2012.

N. Przulj, Graph theory approaches to protein interaction data analysis, vol.120, p.0, 2003.

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, pp.567-580, 2008.

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
URL : https://doi.org/10.1016/j.tcs.2006.06.015

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

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