On Verifying and Maintaining Connectivity of Interval Temporal Networks, Parallel Processing Letters, vol.29, issue.02, p.1950009, 2019. ,
An empirical study of dynamic graph algorithms, ACM Journal of Experimental Algorithmics, vol.2, p.5, 1997. ,
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. ,
The Anatomy of a Scientific Rumor, Scientific Reports, vol.3, issue.1, 2013. ,
MAWILab, Proceedings of the 6th International COnference on - Co-NEXT '10, 2010. ,
URL : https://hal.archives-ouvertes.fr/ensl-00552071
Contact Patterns among High School Students, PLoS ONE, vol.9, issue.9, p.e107878, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01065922
Similar User Clustering based on MovieLens Data Set, GroupLens Research: MovieLens data sets, 2014. ,
A Connectivity Model for Agreement in Dynamic Systems, Lecture Notes in Computer Science, pp.333-345, 2015. ,
Randomized fully dynamic graph algorithms with polylogarithmic time per operation, Journal of the ACM, vol.46, issue.4, pp.502-516, 1999. ,
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. ,
, Forte delta-connexité dans les flots de liens. ALGOTEL, 2016.
What's in a crowd? Analysis of face-to-face behavioral networks, Journal of Theoretical Biology, vol.271, issue.1, pp.166-180, 2011. ,
An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms, ACM Journal of Experimental Algorithmics, vol.6, p.4, 2001. ,
Dynamic graph connectivity in polylogarithmic worst case time, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013. ,
, , 2016.
Connectivity and Inference Problems for Temporal Networks, Journal of Computer and System Sciences, vol.64, issue.4, pp.820-842, 2002. ,
KONECT, Proceedings of the 22nd International Conference on World Wide Web - WWW '13 Companion, pp.1343-1350, 2013. ,
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
Mining of Massive Datasets, SNAP Datasets: Stanford large network dataset collection, 2014. ,
Measurement and analysis of online social networks, Proceedings of the 7th ACM SIGCOMM conference on Internet measurement - IMC '07, 2007. ,
Components in time-varying graphs, Chaos: An Interdisciplinary Journal of Nonlinear Science, vol.22, issue.2, p.023101, 2012. ,
Motifs in Temporal Networks, Proceedings of the Tenth ACM International Conference on Web Search and Data Mining - WSDM '17, 2017. ,
Straph -Python Library for the modelisation and analysis of Stream Graphs, 2020. ,
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
On the evolution of user interaction in Facebook, Proceedings of the 2nd ACM workshop on Online social networks - WOSN '09, 2009. ,
Faster Deterministic Fully-Dynamic Graph Connectivity, Encyclopedia of Algorithms, pp.1-4, 2015. ,
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