ForceAtlas2, a continuous graph layout algorithm for handy network visualization designed for the Gephi software

PLoS ONE

Volumn 9, Issue 6, 2014, Pages

  Jacomy, Mathieu ^a,b,c   Venturini, Tommaso ^a   Heymann, Sebastien ^c,d   Bastian, Mathieu ^c  

^a SCIENCES PO   (France)

^b Equipex DIME SHS   (France)

^c WebAtlas   (France)

^d UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPARATIVE STUDY; COMPUTER INTERFACE; COMPUTER NETWORK; COMPUTER PROGRAM; FORCE; GRAVITY; PHYSICAL PARAMETERS; PROCESS OPTIMIZATION; QUALITY CONTROL; REPULSION; SIMULATION; TEMPERATURE; COMPUTER GRAPHICS;

ALGORITHMS; COMPUTER GRAPHICS; SOFTWARE;

EID: 84902603261     PISSN: None     EISSN: 19326203     Source Type: Journal    
DOI: 10.1371/journal.pone.0098679     Document Type: Article

References (21)

1. Bastian M, Heymann S, Jacomy M (2009) Gephi: an open source software for exploring and manipulating networks. In: International AAAI Conference on Weblogs and Social Media. Association for the Advancement of Artificial Intelligence.
2. Diminescu D (2008) The connected migrant: an epistemological manifesto. Social Science Information 47: 565-579.
3. Batagelj V, Mrvar A (1998) Pajek-program for large network analysis. Connections 21: 47-57.
4. Adar E (2006) Guess: a language and interface for graph exploration. In: Proceedings of the SIGCHI conference on Human Factors in computing systems. ACM, 791-800.
5. Frick A, Ludwig A, Mehldau H (1994) A fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration).
6. Davidson R, Harel D (1996) Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics (TOG) 15: 301-331. (Pubitemid 126418648)
7. Hu YF (2005) Efficient and high quality force-directed graph drawing. The Mathematica Journal 10: 37-71.
8. Martin S, Brown WM, Klavans R, Boyack KW (2011) OpenOrd: an open-source toolbox for large graph layout. In: Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series. volume 7868 of Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series.
9. Walshaw C (2001) A multilevel algorithm for force-directed graph drawing. In: Graph Drawing. Springer, 171-182.
10. Kamada T, Kawai S (1989) An algorithm for drawing general undirected graphs. Information processing letters 31: 7-15.
11. Noack A (2007) Energy models for graph clustering. J Graph Algorithms Appl 11: 453-480.
12. Noack A (2009) Modularity clustering is force-directed layout. Physical Review E 79.
13. Newman MEJ (2004). Analysis of weighted networks. Arxiv:cond-mat/0407503.
14. Newman MEJ (2006) Modularity and community structure in networks. Proceedings of the National Academy of Sciences 103: 8577-8582.
15. Krzywinski M, Birol I, Jones SJ, Marra MA (2012) Hive plotsrational approach to visualizing networks. Briefings in Bioinformatics 13: 627-644.
16. Eades P (1984) A heuristic for graph drawing. Congressus Numerantium 42: 149-160.
17. Fruchterman TMJ, Reingold EM (1991) Graph drawing by force-directed placement. Softw: Pract Exper 21: 1129-1164.
18. Noack A (2007) Unified quality measures for clusterings, layouts, and orderings of graphs, and their application as software design criteria. PhD thesis, Brandenburg University of Technology, Cottbus, Germany.
19. Kleinberg JM (1999) Authoritative sources in a hyperlinked environment. J ACM 46: 604-632.
20. Barnes J, Hut P (1986) A hierarchical o(n log n) force-calculation algorithm. Nature 324: 446-449.
21. Purchase H (2002) Metrics for graph drawing aesthetics. Journal of Visual Languages and Computing 13: 501-516.