Force-directed graph drawing using social gravity and scaling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 7704 LNCS, Issue , 2013, Pages 414-425

  Bannister, Michael J ^a   Eppstein, David ^a   Goodrich, Michael T ^a   Trott, Lowell ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIONAL FORCES; ALGORITHMIC FRAMEWORK; CENTRAL LOCATIONS; COMPLEX SOCIAL NETWORKS; FORCE-DIRECTED; FORCE-DIRECTED LAYOUT; GRAPH DRAWING; GRAVITATIONAL FORCES; NETWORK CENTRALITIES; PHYSICAL FORCE; SOCIAL NETWORKS;

ALGORITHMS; DIRECTED GRAPHS; DRAWING (GRAPHICS); SOCIAL NETWORKING (ONLINE);

GRAVITATION;

EID: 84874123787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-36763-2_37     Document Type: Conference Paper

References (24)

1. Borgatti, S.P.,Mehra, A., Brass, D.J., Labianca, G.: Network Analysis in the Social Sciences. Science 323(5916), 892-895 (2009), http://dx.doi.org/10. 1126/science.1165821
2. Brandenburg, F.J., Himsolt, M., Rohrer, C.: An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 76-87. Springer, Heidelberg (1996), http://dx.doi.org/10.1007/BFb0021792
3. Brandes, U.: A faster algorithm for betweenness centrality. The Journal of Mathematical Sociology 25(2), 163-177 (2001), http://dx.doi.org/10.1080/ 0022250X.2001.9990249
4. Brandes, U.: Drawing on Physical Analogies. In: Kaufmann, M.,Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 71-86. Springer, Heidelberg (2001)
5. Brandes, U., Freeman, L.C., Wagner, D.: Social networks. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, pp. 26-1-26-32. Chapman & Hall/CRC (2013)
6. Brandes, U., Kenis, P., Raab, J.: Explanation Through Network Visualization. Methodology: European Journal of Research Methods for the Behavioral and Social Sciences 2(1), 16-23 (2006), http://dx.doi.org/10.1027/ 1614-2241.2.1.16
7. Brandes, U., Pich, C.: More Flexible Radial Layout. Journal of Graph Algorithms and Applications 15(1), 157-173 (2011), http://jgaa.info/accepted/ 2011/BrandesPich2011.15.1.pdf
8. Chernobelskiy, R., Cunningham, K.I., Goodrich, M.T., Kobourov, S.G., Trott, L.: Force-Directed Lombardi-Style Graph Drawing. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 320-331. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-25878-7-31
9. Correa, C., Crnovrsanin, T., Ma, K.L.: Visual reasoning about social networks using centrality sensitivity. IEEE Trans. on Visualization and Computer Graphics 18(1), 106-120 (2012), http://dx.doi.org/10.1109/TVCG.2010.260
10. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall PTR, Upper Saddle River (1998)
11. Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Löffler, M.: Planar and Polyarc Lombardi Drawings. In: van Kreveld, M., Speckmann, B. (eds.) GD 2011. LNCS, vol. 7034, pp. 308-319. Springer, Heidelberg (2012), http://dx.doi.org/10.1007/978-3-642-25878-7-30
12. Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Nöllenburg, M.: Drawing Trees with Perfect Angular Resolution and Polynomial Area. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 183-194. Springer, Heidelberg (2011)
13. Duncan, C.A., Eppstein, D., Goodrich, M.T., Kobourov, S.G., Nöllenburg, M.: Lombardi Drawings of Graphs. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 195-207. Springer, Heidelberg (2011)
14. Dwyer, T., Eades, P.: Visualising a fund manager flow graph with columns and worms. In: 6th Int. Conf. on Information Visualisation, pp. 147-152 (2002), http://dx.doi.org/10.1109/IV.2002.1028770
15. Freeman, L.C.: Centrality in social networks conceptual clarification. Social Networks 1(3), 215-239 (1979), http://dx.doi.org/10.1016/0378- 87337890021-7
16. Frick, A., Ludwig, A., Mehldau, H.: A Fast Adaptive Layout Algorithm for Undirected Graphs (Extended Abstract and System Demonstration). In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 388-403. Springer, Heidelberg (1995)
17. Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Software: Practice and Experience 21(11), 1129-1164 (1991), http://dx.doi.org/10.1002/spe.4380211102
18. Furht, B.: Handbook of Social Network Technologies and Applications. Springer (2010)
19. Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. Comp 29(1), 3-18 (2004)
20. Gajer, P., Kobourov, S.G.: GRIP: Graph dRawing with Intelligent Placement. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 222-228. Springer, Heidelberg (2001) (Pubitemid 33243333)
21. Hu, Y.F.: Efficient and high quality force-directed graph drawing. The Mathematica Journal 10(1), 37-71 (2005)
22. Lombardi, M., Hobbs, R.: Mark Lombardi: Global Networks. Independent Curators (2003)
23. Sander, G.: Graph layout for applications in compiler construction. Theoretical Computer Science 217(2), 175-214 (1999), http://dx.doi.org/10.1016/ S0304-39759800270-9
24. Stephenson, K., Zelen, M.: Rethinking centrality: Methods and examples. Social Networks 11(1), 1-37 (1989), http://dx.doi.org/10.1016/0378-87338990016-6