Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MAIS_2010_17_1_a8, author = {S. N. Pupyrev and A. V. Tikhonov}, title = {The analysis of complex networks with dynamic graph visualization}, journal = {Modelirovanie i analiz informacionnyh sistem}, pages = {117--135}, publisher = {mathdoc}, volume = {17}, number = {1}, year = {2010}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a8/} }
TY - JOUR AU - S. N. Pupyrev AU - A. V. Tikhonov TI - The analysis of complex networks with dynamic graph visualization JO - Modelirovanie i analiz informacionnyh sistem PY - 2010 SP - 117 EP - 135 VL - 17 IS - 1 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a8/ LA - ru ID - MAIS_2010_17_1_a8 ER -
S. N. Pupyrev; A. V. Tikhonov. The analysis of complex networks with dynamic graph visualization. Modelirovanie i analiz informacionnyh sistem, Tome 17 (2010) no. 1, pp. 117-135. http://geodesic.mathdoc.fr/item/MAIS_2010_17_1_a8/
[1] R. Albert, A.-L. Barabasi, “Statistical mechanics of complex networks”, Reviews of Modern Physics, 74 (2002), 47–97 | DOI | MR | Zbl
[2] K. Boitmanis, U. Brandes, C. Pich, “Visualizing internet evolution on the autonomous systems level”, Proc. 15th Intl. Symp. Graph Drawing, 2007, 365–376
[3] J. Branke, “Dynamic graph drawing”, Drawing Graphs, Springer Lecture Notes In Computer Science, 2001, 228–246 | MR | Zbl
[4] L. Chen, A. Buja, “Local multidimensional scaling for nonlinear dimension reduction, graph layout and proximity analysis”, Journal of the American Statistical Association, 104:485 (2009), 209–219 | DOI | MR
[5] S. Diehl, C. Görg, “Graphs, they are changing”, Proc. 10th Int. Symp. on Graph Drawing, 2002, 23–30 | MR | Zbl
[6] T. Dwyer, Two and a Half Dimensional Visualisation of Relational Networks, PhD thesis, The University of Sydney, 2005
[7] P. Eades, “A heuristic for graph drawing”, Congressus Numerantium, 42 (1984), 149–160 | MR
[8] C. Erten, P. J. Harding, S. G.Kobourov, K. Wampler, G. Yee, “Exploring the computing literature using temporal graph visualization”, Proc. of SPIE, 5295, 2004, 45–56 | DOI
[9] T. Fruchterman, E. Reingold, “Graph drawing by force-directed placement”, Softw. Pract. Exp., 21:11 (1991), 1129–1164 | DOI
[10] X. Fu, S.-H. Hong, N. S. Nikolov, X. Shen, Y. Wu, K. Xu, “Visualization and analysis of email networks”, Proc. of Asia-Pacific Symp. on Visualisation, 2007, 1–8
[11] E. R. Gansner, Y. Koren, S. C. North, “Graph drawing by stress majorization”, Proc. 12th Int. Symposium on Graph Drawing, 2004, 239–250
[12] H.Hanstein, G. Groh, “Interactive visualization of dynamic social networks”, GI Jahrestagung, 2, 2008, 929–936
[13] D. Harel, Y. Koren, “A fast multi-scale method for drawing large graphs”, Journal of Graph Algorithms and Applications, 6:3 (2002), 282–285 | MR
[14] T. Kamada, S. Kawai, “An algorithm for drawing general undirected graphs”, Inform. Process. Lett., 31 (1989), 7–15 | DOI | MR | Zbl
[15] B. Klimt, Y. Yang, “Introducing the enron corpus”, Proc. of First Conf. on Email and Anti-Spam, 2004
[16] J. B. Kruskal, J. B. Seery, “Designing network diagrams”, Proc. of the First General Conference on Social Graphics, 1980, 22–50
[17] K. Misue, P. Eades, W. Lai, K. Sugiyama, “Layout adjustment and the mental map”, Journal of Visual Languages and Computing, 6:2 (1995), 183–210 | DOI
[18] A. Noack, “An energy model for visual graph clustering”, Proc. 11th Int. Symp. on Graph Drawing, 2003, 425–436 | MR
[19] C. Pich, Applications of Multidimensional Scaling to Graph Drawing, PhD thesis, Universitat Konstanz, 2009
[20] H. Purchase, “Which aesthetic has the greatest effect on human understanding?”, Proc. 5th Int. Symp. on Graph Drawing, 1998, 248–261
[21] W. T. Tutte, “How to draw a graph”, Proc. London Math. Society, 13:52 (1963), 743–768 | MR | Zbl
[22] Sistema vizualizatsii grafov GraphVis, http://graphvis.googlecode.com