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
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
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
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
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
Maximizing modularity is hard. arxiv.org, p.608255, 2006. ,
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
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
Graphs, They Are Changing, Proceedings of the International Symposium on Graph Drawing, pp.23-30, 2002. ,
DOI : 10.1007/3-540-36151-0_3
CRAWDAD data set mit/reality (v. 2005-07-01) Downloaded from http, 2005. ,
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
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
Computers and Intractability: a Guide to the Theory of NP-Completeness, 1979. ,
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
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
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
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
Embedding, clustering and coloring for dynamic maps, Proceedings of the 5th IEEE Pacific Visualization Symposium, pp.33-40, 2012. ,
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
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
Advanced Visualization Techniques for Abstract Graphs and Computer Networks . Dissertation, 2011. ,
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
Graph clustering, Physical Review E, vol.69, 2004. ,
Incremental layout in DynaDAG, Proceedings of the International Symposium on Graph Drawing (GD'95), pp.409-418, 1996. ,
DOI : 10.1007/BFb0021824
Software evolution storylines, Proceedings of the 5th international symposium on Software visualization, SOFTVIS '10, pp.35-42, 2010. ,
DOI : 10.1145/1879211.1879219
Experiments on the minimum linear arrangement problem, Journal of Experimental Algorithmics, vol.8, 2001. ,
DOI : 10.1145/996546.996554
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
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
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. ,
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
Graph clustering, Computer Science Review, vol.1, issue.1, pp.27-64, 2007. ,
DOI : 10.1016/j.cosrev.2007.05.001
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
Interactive Visualization of Small World Graphs, IEEE Symposium on Information Visualization, pp.199-206, 2004. ,
DOI : 10.1109/INFVIS.2004.43
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 ,
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 ,