S. E. Ahnert, Generalised power graph compression reveals dominant relationship patterns in complex networks, Scientific reports, vol.4, 2014.

L. Bourneuf and J. Nicolas, Fca in a logical programming setting for visualizationoriented graph compression, Formal Concept Analysis: 14th International Conference, ICFCA 2017, pp.89-105, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01558302

G. Chiaselotti, D. Ciucci, and T. Gentile, Simple undirected graphs as formal contexts, International Conference on Formal Concept Analysis, vol.9113, pp.187-302, 2015.

T. Dwyer, N. Henry-riche, K. Marriott, and C. Mears, Edge compression techniques for visualization of dense directed graphs, IEEE Transactions on Visualization and Computer Graphics, vol.19, issue.12, pp.2596-2605, 2013.

T. Dwyer, C. Mears, K. Morgan, T. Niven, K. Marriott et al., Improved optimal and approximate power graph compression for clearer visualisation of dense graphs, 2013.

J. Gagneur, R. Krause, T. Bouwmeester, and G. Casari, Modular decomposition of protein-protein interaction networks, Genome Biology, vol.5, issue.8, p.57, 2004.

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.

B. Jocelyn and H. Seba, Solving the Maximal Clique Problem on Compressed Graphs, 24th International Symposium on Methodologies on Intelligent ( ISMIS 2018), Foundations of Intelligent Systems, pp.45-55, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01886654

A. D. King, N. Pr?ulj, and I. Jurisica, Protein complex prediction via cost-based clustering, Bioinformatics, vol.20, issue.17, pp.3013-3020, 2004.

S. Navlakha, M. C. Schatz, and C. Kingsford, Revealing biological modules via graph summarization, Journal of Computational Biology, vol.16, issue.2, pp.253-264, 2009.

H. Ogata, W. Fujibuchi, S. Goto, and M. Kanehisa, A heuristic graph comparison algorithm and its application to detect functionally related enzyme clusters, Nucleic Acids Research, vol.28, issue.20, pp.4021-4028, 2000.

C. Papadopoulos and C. Voglis, Drawing graphs using modular decomposition, Graph Drawing, pp.343-354, 2006.

L. Royer, M. Reimann, B. Andreopoulos, and M. Schroeder, Unraveling Protein Networks with Power Graph Analysis, PLoS Comput Biol, vol.4, issue.7, p.1000108, 2008.

P. Serafino, Speeding up graph clustering via modular decomposition based compression, Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC '13, pp.156-163, 2013.

G. Tsatsaronis, M. Reimann, I. Varlamis, O. Gkorgkas, and K. Nørvåg, Efficient community detection using power graph analysis, Proc. of the 9th Workshop on Large-scale and Distributed Informational Retrieval, LSDS-IR '11, pp.21-26, 2011.