F. Zhou, S. Mahler, and H. Toivonen, Workshop on Explorative Analytics of Information Networks at ECML PKDD, pp.50-63, 2009.

H. Toivonen, F. Zhou, A. Hartikainen, and A. Hinkka, Compression of Weighted Graphs, Proceedings of the 17 th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp.965-973, 2011.

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.

S. Navlakha, R. Rastogi, and N. Shrivastava, Graph Summarization with Bounded Error, Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data (SIGMOD'08), pp.419-432, 2008.

N. Zhang, Y. Tian, and J. M. Patel, Discovery-Driven Graph Summarization, Proceedings of the 26th International Conference on Data Engineering (ICDE'2010), pp.880-891, 2010.

K. Lefevre and E. Terzi, Proceedings of the SIAM International Conference on Data Mining (SDM'2010), pp.454-465, 2010.

B. Pinaud, G. Melancon, and J. Dubois, PORGY: A Visual Graph Rewriting Environment for Complex Systems, Computer Graphics Forum, vol.31, issue.3, pp.1265-1274, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00682550

T. Dwyer, N. H. 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.

S. E. Ahnert, Generalised power graph compression reveals dominant relationship patterns in complex networks, Scientific Reports, vol.4, issue.4385

, Temporal Networks, Understanding Complex Systems, 2013.

T. Viard, M. Latapy, and C. Magnien, Computing maximal cliques in link streams, Theoretical Computer Science, vol.609, p.245252, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01112627

M. Latapy, T. Viard, and C. Magnien, Stream Graphs and Link Streams for the Modeling of Interactions over Time
URL : https://hal.archives-ouvertes.fr/hal-01665084

S. P. Borgatti and M. G. Everett, Regular blockmodels of multiway, multimode matrices, Social Networks, vol.14, issue.1, pp.91-120, 1992.

N. Narmadha and R. Rathipriya, Triclustering: An Evolution of Clustering, Proceedings of the Online International Conference on Green Engineering and Technologies (IC-GET'16), pp.1-4, 2016.

R. Guigourès, M. Boullé, and F. Rossi, A Triclustering Approach for Time Evolving Graphs, Co-clustering and Applications International Conference on Data Mining Workshop, pp.115-122, 2012.

F. Lorrain and H. C. White, Structural equivalence of individuals in social networks, The Journal of Mathematical Sociology, vol.1, issue.1, pp.49-80, 1971.

E. Balas and M. W. Padberg, Set Partitioning: A Survey, vol.18, pp.710-760, 1976.

R. Lamarche-perrin, Y. Demazeau, and J. Vincent, A Generic Algorithmic Framework to Solve Special Versions of the Set Partitioning Problem, Proceedings of the 2014 IEEE 26 th International Conference on Tools with Artificial Intelligence (ICTAI'14), pp.891-897, 2014.
URL : https://hal.archives-ouvertes.fr/hal-02187571

D. Dosimont, R. Lamarche-perrin, L. M. Schnorr, G. Huard, and J. Vincent, A Spatiotemporal Data Aggregation Technique for Performance Analysis of Large-scale Execution Traces, Proceedings of the 2014 IEEE International Conference on Cluster Computing (CLUSTER'14), pp.149-157, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01065093

V. Batagelj, A. Ferligoj, and P. Doreian, Direct and indirect methods for structural equivalence, Social Networks, vol.14, issue.1, pp.63-90, 1992.

R. A. Hanneman and M. Riddle, Introduction to social network methods, 2005.

S. Fortunato, Community detection in graphs, Physics Reports, vol.486, issue.3, pp.75-174, 2010.

I. S. Dhillon, S. Mallela, and D. S. Modha, Information-theoretic Co-clustering, Proceedings of the Ninth ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD'03), pp.89-98, 2003.

R. Lamarche-perrin, Y. Demazeau, and J. Vincent, Building Optimal Macroscopic Representations of Complex Multi-agent Systems. Application to the Spatial and Temporal Analysis of International Relations through News Aggregation, Transactions on Computational Collective Intelligence, vol.XV, pp.1-27, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01263846

R. V. Hofstad, Configuration Model, vol.1, p.216255, 2016.

S. Kullback and R. A. Leibler, On Information and Sufficiency, vol.22, pp.79-86, 1951.
DOI : 10.1214/aoms/1177729694
URL : https://doi.org/10.1214/aoms/1177729694

T. M. Cover and J. A. Thomas, Elements of Information Theory, 2 nd Edition, 2006.

H. He and A. K. Singh, Closure-Tree: An Index Structure for Graph Queries, nd International Conference on Data Engineering (ICDE'06, pp.38-38, 2006.

T. Feder and R. Motwani, Clique Partitions, Graph Compression and Speeding-Up Algorithms, Journal of Computer and System Sciences, vol.51, issue.2, pp.261-272, 1995.
DOI : 10.1145/103418.103424

C. Hernández and G. Navarro, Compressed Representation of Web and Social Networks via Dense Subgraphs, String Processing and Information Retrieval, vol.7608, pp.264-276, 2012.

M. Dhabu, P. S. Deshpande, and S. Vishwakarma, Partition based graph compression, International Journal of Advanced Computer Science and Applications, vol.4, issue.9, pp.7-12, 2013.
DOI : 10.14569/ijacsa.2013.040902
URL : http://thesai.org/Downloads/Volume4No9/Paper_2-Partition_based_Graph_Compression.pdf

D. M. Roy and T. Y. Whye, The Mondrian Process, Advances in Neural Information Processing Systems, vol.21, pp.1377-1384, 2009.

R. Lamarche-perrin, Y. Demazeau, and J. Vincent, A Generic Algorithmic Framework to Solve Special Versions of the Set Partiioning Problem, 2014.

T. Sandholm, K. Larson, M. Andersson, O. Shehory, and F. Tohmé, Coalition structure generation with worst case guarantees, Artificial Intelligence, vol.111, issue.1-2, pp.209-238, 1999.

T. Rahwan and N. R. Jennings, Coalition Structure Generation: Dynamic Programming Meets Anytime Optimisation, Proceedings of the Twenty-third Conference on Artificial Intelligence, AAAI, pp.156-161, 2008.

T. Sandholm, Algorithm for optimal winner determination in combinatorial auctions, Artificial Intelligence, vol.135, pp.1-54, 2002.

P. Pons and M. Latapy, Post-processing hierarchical community structures: Quality improvements and multi-scale view, Theoretical Computer Science, vol.412, issue.8-10, pp.892-900, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01146086

B. Cloitre and A. Sequence, The On-Line Encyclopedia of Integer Sequences, 2002.

G. Mcgarvey, The On-Line Encyclopedia of Integer Sequences, 2007.

S. Anily and A. Federgruen, Structured Partitioning Problems, Operations Research, vol.39, issue.1, pp.130-149, 1991.

B. Jackson, J. D. Scargle, D. Barnes, S. Arabhi, and A. Alt, An algorithm for optimal partitioning of data on an interval, IEEE Signal Processing Letters, vol.12, issue.2, pp.105-108, 2005.

G. Pagano, D. Dosimont, G. Huard, V. Marangozova-martin, and J. Vincent, Trace Management and Analysis for Embedded Systems, Proceedings of the 7 th International Symposium on Embedded Multicore SoCs (MCSoC'13), pp.119-122, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01065877

M. H. Rothkopf, A. Peke?, and R. M. Harstad, Computationally Manageable Combinational Auctions, vol.44, pp.1131-1147, 1998.

R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Ch. Lagrangian Relaxation and Network Optimization, Network Flows: Theory, Algorithms, and Applications, pp.598-648, 1993.

A. K. Chakravarty, J. B. Orlin, and U. G. Rothblum, A partitioning problem with additive objective with an application to optimal inventory groupings for joint replenishment, Operations Research, vol.30, issue.5, pp.1018-1022, 1982.

R. V. Vidal, Optimal Partition of an Interval -The Discrete Version, Applied Simulated Annealing, vol.396, pp.291-312, 1993.

B. Davey and H. Priestley, Introduction to Lattices and Order, 2002.
DOI : 10.1017/cbo9780511809088