E. C. Akrida and P. G. Spirakis, On Verifying and Maintaining Connectivity of Interval Temporal Networks, Parallel Processing Letters, vol.29, issue.02, p.1950009, 2019.

D. Alberts, G. Cattaneo, and G. F. Italiano, An empirical study of dynamic graph algorithms, ACM Journal of Experimental Algorithmics, vol.2, p.5, 1997.

S. Bhadra and A. Ferreira, Computing multicast trees in dynamic networks and the complexity of connected components in evolving graphs, Journal of Internet Services and Applications, vol.3, issue.3, pp.269-275, 2012.

M. De-domenico, A. Lima, P. Mougel, and M. Musolesi, The Anatomy of a Scientific Rumor, Scientific Reports, vol.3, issue.1, 2013.

R. Fontugne, P. Borgnat, P. Abry, and K. Fukuda, MAWILab, Proceedings of the 6th International COnference on - Co-NEXT '10, 2010.
URL : https://hal.archives-ouvertes.fr/ensl-00552071

J. Fournet and A. Barrat, Contact Patterns among High School Students, PLoS ONE, vol.9, issue.9, p.e107878, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01065922

H. Lee and J. Kwon, Similar User Clustering based on MovieLens Data Set, GroupLens Research: MovieLens data sets, 2014.

C. Gómez-calzado, A. Casteigts, A. Lafuente, and M. Larrea, A Connectivity Model for Agreement in Dynamic Systems, Lecture Notes in Computer Science, pp.333-345, 2015.

M. R. Henzinger and V. King, Randomized fully dynamic graph algorithms with polylogarithmic time per operation, Journal of the ACM, vol.46, issue.4, pp.502-516, 1999.

S. E. Huang, D. E. Huang, T. Kopelowitz, and S. Pettie, Fully Dynamic Connectivity in O(log n(log log n)2) Amortized Expected Time, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017.

C. Huyghues-despointes, B. M. Bui-xuan, and C. Magnien, Forte delta-connexité dans les flots de liens. ALGOTEL, 2016.

L. Isella, J. Stehlé, A. Barrat, C. Cattuto, J. F. Pinton et al., What's in a crowd? Analysis of face-to-face behavioral networks, Journal of Theoretical Biology, vol.271, issue.1, pp.166-180, 2011.

R. Iyer, D. Karger, H. Rahul, and M. Thorup, An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms, ACM Journal of Experimental Algorithmics, vol.6, p.4, 2001.

B. M. Kapron, V. King, and B. Mountjoy, Dynamic graph connectivity in polylogarithmic worst case time, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013.

C. Kejlberg-rasmussen, T. Kopelowitz, S. Pettie, and M. Thorup, , 2016.

D. Kempe, J. Kleinberg, and A. Kumar, Connectivity and Inference Problems for Temporal Networks, Journal of Computer and System Sciences, vol.64, issue.4, pp.820-842, 2002.

J. Kunegis, KONECT, Proceedings of the 22nd International Conference on World Wide Web - WWW '13 Companion, pp.1343-1350, 2013.

M. Latapy, T. Viard, and C. Magnien, Stream graphs and link streams for the modeling of interactions over time, Social Network Analysis and Mining, vol.8, issue.1, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01665084

J. Leskovec, A. Rajaraman, and J. D. Ullman, Mining of Massive Datasets, SNAP Datasets: Stanford large network dataset collection, 2014.

A. Mislove, M. Marcon, K. P. Gummadi, P. Druschel, and B. Bhattacharjee, Measurement and analysis of online social networks, Proceedings of the 7th ACM SIGCOMM conference on Internet measurement - IMC '07, 2007.

V. Nicosia, J. Tang, M. Musolesi, G. Russo, C. Mascolo et al., Components in time-varying graphs, Chaos: An Interdisciplinary Journal of Nonlinear Science, vol.22, issue.2, p.023101, 2012.

A. Paranjape, A. R. Benson, and J. Leskovec, Motifs in Temporal Networks, Proceedings of the Tenth ACM International Conference on Web Search and Data Mining - WSDM '17, 2017.

L. Rannou, Straph -Python Library for the modelisation and analysis of Stream Graphs, 2020.

M. Vernet, M. Drozdowski, Y. Pigné, and E. Sanlaville, A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs, Discrete Applied Mathematics, 2020.
URL : https://hal.archives-ouvertes.fr/hal-02430162

B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi, On the evolution of user interaction in Facebook, Proceedings of the 2nd ACM workshop on Online social networks - WOSN '09, 2009.

C. Wulff-nilsen, Faster Deterministic Fully-Dynamic Graph Connectivity, Encyclopedia of Algorithms, pp.1-4, 2015.

B. B. Xuan, A. Ferreira, and A. Jarry, COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS, International Journal of Foundations of Computer Science, vol.14, issue.02, pp.267-285, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00071996