J. Abello, F. Van-ham, and N. Krishnan, ASK-GraphView: A Large Scale Graph Visualization System, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.669-676, 2006.
DOI : 10.1109/TVCG.2006.120

D. Archambault, T. Munzner, and D. Auber, GrouseFlocks: Steerable Exploration of Graph Hierarchy Space, IEEE Transactions on Visualization and Computer Graphics, vol.14, issue.4, pp.900-913, 2008.
DOI : 10.1109/TVCG.2008.34
URL : https://hal.archives-ouvertes.fr/inria-00338627

D. Archambault, H. C. Purchase, and B. Pinaud, Animation, Small Multiples, and the Effect of Mental Map Preservation in Dynamic Graphs, IEEE Transactions on Visualization and Computer Graphics, vol.17, issue.4, pp.539-552, 2011.
DOI : 10.1109/TVCG.2010.78
URL : https://hal.archives-ouvertes.fr/inria-00472423

V. Blondel, J. Guillaume, R. Lambiotte, and E. Lefebvre, Fast unfolding of communities in large networks, Journal of Statistical Mechanics: Theory and Experiment, vol.2008, issue.10, 2008.
DOI : 10.1088/1742-5468/2008/10/P10008
URL : https://hal.archives-ouvertes.fr/hal-01146070

K. Boitmanis, U. Brandes, and C. Pich, Visualizing Internet Evolution on the Autonomous Systems Level, Proceedings of the International Symposium on Graph Drawing, pp.365-376, 2008.
DOI : 10.1007/978-3-540-77537-9_36

U. Brandes, D. Delling, M. Gaertler, R. Goerke, M. Hoefer et al., Maximizing modularity is hard. arxiv.org, p.608255, 2006.

U. Brandes and M. Mader, A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing, Proceedings of the International Symposium on Graph Drawing, pp.99-110, 1012.
DOI : 10.1023/A:1009683123448

M. Burch, C. Vehlow, F. Beck, S. Diehl, and D. Weiskopf, Parallel Edge Splatting for Scalable Dynamic Graph Visualization, IEEE Transactions on Visualization and Computer Graphics, vol.17, issue.12, pp.2344-2353, 2011.
DOI : 10.1109/TVCG.2011.226

S. Diehl and C. Görg, Graphs, They Are Changing, Proceedings of the International Symposium on Graph Drawing, pp.23-30, 2002.
DOI : 10.1007/3-540-36151-0_3

N. Eagle and A. S. Pentland, CRAWDAD data set mit/reality (v. 2005-07-01) Downloaded from http, 2005.

C. Erten, P. J. Harding, S. G. Kobourov, K. Wampler, and G. V. Yee, GraphAEL: Graph Animations with Evolving Layouts, Proceedings of the International Symposium on Graph Drawing (GD'03) Volume 2912 of LNCS, pp.98-110, 2004.
DOI : 10.1007/978-3-540-24595-7_9

Y. Frishman and A. Tal, Online Dynamic Graph Drawing, IEEE Transactions on Visualization and Computer Graphics, vol.14, issue.4, pp.727-740, 2008.
DOI : 10.1109/TVCG.2008.11

M. R. Garey and D. S. Johnson, Computers and Intractability: a Guide to the Theory of NP-Completeness, 1979.

C. Görg, P. Birke, M. Pohl, and S. Diehl, Dynamic Graph Drawing of Sequences of Orthogonal and Hierarchical Graphs, Proceedings of the International Symposium on Graph Drawing, pp.228-238, 2004.
DOI : 10.1007/978-3-540-31843-9_24

S. Hachul and M. Jünger, An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs, Proceedings of the International Symposium on Graph Drawing (GD'05), pp.235-250, 2006.
DOI : 10.1007/11618058_22

H. J. Haverkort and F. Van-walderveen, Locality and bounding-box quality of two-dimensional space-filling curves, Computational Geometry, vol.43, issue.2, pp.131-147, 2010.
DOI : 10.1016/j.comgeo.2009.06.002

D. Holten, Hierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.741-748, 2006.
DOI : 10.1109/TVCG.2006.147

Y. Hu, S. G. Kobourov, and S. Veeramoni, Embedding, clustering and coloring for dynamic maps, Proceedings of the 5th IEEE Pacific Visualization Symposium, pp.33-40, 2012.

Y. Koren and D. Harel, A Multi-scale Algorithm for the Linear Arrangement Problem, 28th International Workshop on Graph-Theoretic Concepts in Computer Science Volume 2573 of LNCS, pp.296-309, 2002.
DOI : 10.1007/3-540-36379-3_26

G. Kumar and M. Garland, Visual Exploration of Complex Time-Varying Graphs, IEEE Transactions on Visualization and Computer Graphics, vol.12, issue.5, pp.805-812, 2006.
DOI : 10.1109/TVCG.2006.193

C. Muelder, Advanced Visualization Techniques for Abstract Graphs and Computer Networks . Dissertation, 2011.

C. Muelder and K. Ma, Rapid Graph Layout Using Space Filling Curves, IEEE Transactions on Visualization and Computer Graphics, vol.14, issue.6, pp.1301-1308, 2008.
DOI : 10.1109/TVCG.2008.158

M. E. Newman and M. Girvan, Graph clustering, Physical Review E, vol.69, 2004.

S. C. North, Incremental layout in DynaDAG, Proceedings of the International Symposium on Graph Drawing (GD'95), pp.409-418, 1996.
DOI : 10.1007/BFb0021824

M. Ogawa and K. Ma, Software evolution storylines, Proceedings of the 5th international symposium on Software visualization, SOFTVIS '10, pp.35-42, 2010.
DOI : 10.1145/1879211.1879219

J. Petit, Experiments on the minimum linear arrangement problem, Journal of Experimental Algorithmics, vol.8, 2001.
DOI : 10.1145/996546.996554

H. Purchase, E. Hoggan, and C. Görg, How Important Is the ???Mental Map???? ??? An Empirical Investigation of a Dynamic Graph Layout Algorithm, Proceedings of the International Symposium on Graph Drawing, pp.184-195, 2007.
DOI : 10.1007/978-3-540-70904-6_19

H. Purchase and A. Samra, Extremes Are Better: Investigating Mental Map Preservation in Dynamic Graphs, Proceedings of the 5th International Conference on Diagrammatic Representation and Inference, pp.60-73, 2008.
DOI : 10.1007/978-3-540-87730-1_9

P. Saffrey and H. Purchase, The "mental map" versus "static aesthetic" compromise in dynamic graphs: A user study, Proceedings of the 9th Australasian User Interface Conference (AUIC2008), pp.85-93, 2008.

A. Sallaberry, C. W. Muelder, and K. Ma, Clustering, Visualizing, and Navigating for Large Dynamic Graphs, Proceedings of the International Symposium on Graph Drawing (GD'12), 2013.
DOI : 10.1007/978-3-642-36763-2_43
URL : https://hal.archives-ouvertes.fr/lirmm-00798793

S. E. Schaeffer, Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007.
DOI : 10.1016/j.cosrev.2007.05.001

Y. Tanahashi and K. Ma, Design Considerations for Optimizing Storyline Visualizations, IEEE Transactions on Visualization and Computer Graphics, vol.18, issue.12, pp.2679-2688, 2012.
DOI : 10.1109/TVCG.2012.212

F. Van-ham and J. J. Van-wijk, Interactive Visualization of Small World Graphs, IEEE Symposium on Information Visualization, pp.199-206, 2004.
DOI : 10.1109/INFVIS.2004.43

L. Résumé, visualisation de graphes dynamiques est un problème difficile Une méthode de clustering que nous avons développée lors d'un précédent travail peut être appliquée à de tels graphes afin de générer des visualisations interactives à la fois stables

. Cependant and . Existante-est-naïve-et-non-optimisée, Dans cet article, nous présentons de nouveaux algorithmes pour améliorer à la fois les résultats du clustering dynamique et la rapidité des calculs, Nous comparons les résultats et le rendement par rapport à la méthode précédente