Graph drawing by force‐directed placement
The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Abstract
We present a modification of the spring‐embedder model of Eades [Congressus Numerantium, 42, 149–160, (1984)] for drawing undirected graphs with straight edges. Our heuristic strives for uniform edge lengths, and we develop it in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“In pathological settings, especially cancer97,130,131, such hybrid states may reflect either transitions (below) or the intrinsic abnormal mixture of different functional modules (N.Y., A.R. and colleagues130).”
From Revealing the vectors of cellular identity with single-cell genomics (2016) · cites this paper as [130]
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
Harary, F. (1969) · Cited by 10,739
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
Stroustrup, B. (1985) · Cited by 4,409
An algorithm for drawing general undirected graphs
Kamada, T., & Kawai, S. (1989) · Information Processing Letters · doi:10.1016/0020-0190(89)90102-6 · Cited by 2,698
Eades, P. (1984) · Congressus Numerantium · Cited by 1,147
The Rapid Evaluation of Potential Fields in Particle Systems
Greengard, L. F. (1988) · The MIT Press eBooks · doi:10.7551/mitpress/5750.001.0001 · Cited by 1,066
Combinatorial Algorithms: Theory and Practice
Reingold, E. M., Nievergelt, J., & Deo, N. (1977) · CERN Document Server (European Organization for Nuclear Research) · Cited by 905
Self-citationAlgorithms for drawing graphs: an annotated bibliography
Battista, G. D., Eades, P., Tamassia, R., & Tollis, I. G. (1994) · Computational Geometry · doi:10.1016/0925-7721(94)00014-x · Cited by 854
Jones, R. (1985) · Data Processing · doi:10.1016/0011-684x(85)90032-2 · Cited by 557
Research works printed but not linked: 5
- Tipler P. A., 1982, Physics
- Kamada T., 1988, Technical Report 88–007
- Hearn D., 1986, Computer Graphics
- Breuer M. A., 1977, Min‐cut placement, Journal of Design Automation and Fault Tolerant Computing, 1, 343
- Dewhurst S. C., 1989, Programming in C++
Cited by
Software survey: VOSviewer, a computer program for bibliometric mapping
van Eck, N. J., & Waltman, L. (2010) · Scientometrics · doi:10.1007/s11192-009-0146-3 · Cited by 21,484
The igraph software package for complex network research
Csárdi, G., & Nepusz, T. (2006) · Medical Entomology and Zoology · Cited by 13,507
SCANPY: large-scale single-cell gene expression data analysis
Wolf, F. A., Angerer, P., & Theis, F. J. (2018) · Genome Biology · doi:10.1186/s13059-017-1382-0 · Cited by 8,881
Estimating psychological networks and their accuracy: A tutorial paper
Epskamp, S., Borsboom, D., & Fried, E. I. (2018) · Behavior Research Methods · doi:10.3758/s13428-017-0862-1 · Cited by 5,715
qgraph: Network Visualizations of Relationships in Psychometric Data
Epskamp, S., Cramer, A. O. J., Waldorp, L. J., Schmittmann, V. D., & Borsboom, D. (2012) · Journal of Statistical Software · doi:10.18637/jss.v048.i04 · Cited by 4,856
“A modified version of a force-embedded algorithm that was proposed by Fruchterman and Reingold (1991) is included in qgraph .”
Network analysis: An integrative approach to the structure of psychopathology
Borsboom, D., & Cramer, A. O. J. (2013) · Annual Review of Clinical Psychology · doi:10.1146/annurev-clinpsy-050212-185608 · Cited by 4,359
“…an algorithm that positions strongly connected nodes in the middle of the graph and the more weakly connected nodes in the periphery of the graph (Fruchterman & Reingold 1991): for example, according to the Dutch clinicians the symptom “depressed mood” is important in the disorder because it has…”
BackgroundInfluentialGradient boosting machines, a tutorial
Natekin, A., & Knoll, A. (2013) · Frontiers in Neurorobotics · doi:10.3389/fnbot.2013.00021 · Cited by 3,887
“Besides, graph representation of the ensemble models would allow one to visually examine the resulting models through graph visulization tools and layouts (Fruchterman and Reingold, 1991; Hu, 2005).”
MethodThe university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Visualizing Bibliometric Networks
van Eck, N. J., & Waltman, L. (2014) · Measuring Scholarly Impact · doi:10.1007/978-3-319-10377-8_13 · Cited by 3,342
“An alternative technique is the algorithm of Fruchterman and Reingold (1991).”
MethodInfluentialDetecting Novel Associations in Large Data Sets
Reshef, D. N., Reshef, Y. A., Finucane, H. K., Grossman, S. R., McVean, G., Turnbaugh, P. J., Lander, E. S., Mitzenmacher, M., & Sabeti, P. C. (2011) · Science · doi:10.1126/science.1205438 · Cited by 3,339
A tutorial on regularized partial correlation networks
Epskamp, S., & Fried, E. I. (2018) · Psychological Methods · doi:10.1037/met0000167 · Cited by 2,918
“Nodes are placed using an modified version of the FruchtermanReingold algorithm (Fruchterman and Reingold, 1991) for weighted networks (Epskamp et al., 2012).”
MethodJacomy, M., Venturini, T., Heymann, S., & Bastian, M. (2014) · PLoS ONE · doi:10.1371/journal.pone.0098679 · Cited by 2,909
Owen-Smith, J., & Powell, W. W. (2004) · Organization Science · doi:10.1287/orsc.1030.0054 · Cited by 2,245
Accelerating t-SNE using tree-based algorithms
van der Maaten, L. (2014) · doi:10.5555/2627435.2697068 · Cited by 2,226
“, for constructing force-directed layouts and for graph drawing (Fruchterman and Reingold, 1991; Chalmers, 1996; Quigley and Eades, 2000; Hu, 2005).”
BackgroundA unified approach to mapping and clustering of bibliometric networks
Waltman, L., van Eck, N. J., & Noyons, E. C. M. (2010) · Journal of Informetrics · doi:10.1016/j.joi.2010.07.002 · Cited by 2,224
Powell, W. W., White, D. R., Koput, K. W., & Owen‐Smith, J. (2005) · American Journal of Sociology · doi:10.1086/421508 · Cited by 2,016
“American Journal of Sociology 1192 We draw first on the Fruchterman-Reingold algorithm (FR; Fruchterman and Reingold 1991), which optimizes network images without reference to the graph theoretic distance among nodes, to develop initial positions for all organizations (connected and unconnected).”
MethodBörner, K., Chen, C., & Boyack, K. W. (2003) · Annual Review of Information Science and Technology · doi:10.1002/aris.1440370106 · Cited by 1,812
“…to sort randomly placed objects into a desirable layout that satisfies the given similarity relations among objects as well as aesthetics for visual presentation (symmetry, non-overlapping, minimized edge crossings, etc.) (Battista, Eades, Tamassia, & Tollis, 1994; Fruchterman & Reingold, 1991).”
BackgroundDynamic reconfiguration of human brain networks during learning
Bassett, D. S., Wymbs, N. F., Porter, M. A., Mucha, P. J., Carlson, J. M., & Grafton, S. T. (2011) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1018985108 · Cited by 1,705
“…PNAS ∣ May 3, 2011 ∣ vol. 108 ∣ no. 18 ∣ 7641–7646 SY ST EM S BI O LO G Y A PP LI ED M AT H EM AT IC S D ow nl oa de d by g ue st o n Ju ne 1 9, 2 02 1 anatomy where few modules uncovered at large spatial scales are complemented by more modules at…”
Wolf, F. A., Hamey, F. K., Plass, M., Solana, J., Dahlin, J. S., Göttgens, B., Rajewsky, N., Simon, L., & Theis, F. J. (2019) · Genome Biology · doi:10.1186/s13059-019-1663-x · Cited by 1,698
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Graph visualization and navigation in information visualization: A survey
Herman, I., Melancon, G., & Marshall, M. S. (2000) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.841119 · Cited by 1,538
“Spring layouts have been used successfully to produce wellbalanced layout for graphs.”
MethodPajek - Program for Large Network Analysis
Batagelj, V., & Mrvar, A. (1999) · Cited by 1,455
Network analysis of multivariate data in psychological science
Borsboom, D., Deserno, M. K., Rhemtulla, M., Epskamp, S., Fried, E. I., McNally, R. J., Robinaugh, D. J., Perugini, M., Dalege, J., Costantini, G., et al. (2021) · Nature Reviews Methods Primers · doi:10.1038/s43586-021-00055-w · Cited by 1,371
A network of protein–protein interactions in yeast
Schwikowski, B., Uetz, P., & Fields, S. (2000) · Nature Biotechnology · doi:10.1038/82360 · Cited by 1,363
Social contagion theory: examining dynamic social networks and human behavior
Christakis, N. A., & Fowler, J. H. (2013) · Statistics in Medicine · doi:10.1002/sim.5408 · Cited by 1,303
Political Polarization on Twitter
Conover, M., Ratkiewicz, J., Francisco, M., Goncalves, B., Flammini, A., & Menczer, F. (2011) · Zenodo · doi:10.5281/zenodo.4589064 · Cited by 1,254
Mass Cytometry: Single Cells, Many Features
Spitzer, M. H., & Nolan, G. P. (2016) · Cell · doi:10.1016/j.cell.2016.04.019 · Cited by 1,199
Can network analysis transform psychopathology?
McNally, R. J. (2016) · Behaviour Research and Therapy · doi:10.1016/j.brat.2016.06.006 · Cited by 1,072
Network analysis: a brief overview and tutorial
Hevey, D. (2018) · Health Psychology and Behavioral Medicine · doi:10.1080/21642850.2018.1521283 · Cited by 1,058
“The most frequently used approach in psychological networks is the Fruchterman-Reingold algorithm (Fruchterman & Reingold, 1991), which calculates the optimal layout so that nodes with less strength and less connections are placed further apart, and those with more and/or stronger connections are…”
MethodPolitical Polarization on Twitter
Conover, M., Ratkiewicz, J., Francisco, M., Goncalves, B., Menczer, F., & Flammini, A. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v5i1.14126 · Cited by 992
“Figure 1 shows the retweet and mention networks, laid out using a force-directed layout algorithm (Fruchterman and Reingold 1991), with node colors determined by the assigned communities.”
MethodHierarchical Edge Bundles: Visualization of Adjacency Relations in Hierarchical Data
Holten, D. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.147 · Cited by 970
“If the inclusion edges EI and the adjacency edges EA are merged into a single set of uniform edges, then the graph G′ = (V,EI ,EA) can be visualized using a generic graph layout algorithm [2, 12, 15].”
MethodExtracting a cellular hierarchy from high-dimensional cytometry data with SPADE
Qiu, P., Simonds, E. F., Bendall, S. C., Gibbs, K. D., Bruggner, R. V., Linderman, M. D., Sachs, K., Nolan, G. P., & Plevritis, S. K. (2011) · Nature Biotechnology · doi:10.1038/nbt.1991 · Cited by 956
“For data with higher dimensions, SPADE uses a modified Fruchterman and Reingold algorithm to automatically compute the layout [15].”
Network analysis of depression and anxiety symptom relationships in a psychiatric sample
Beard, C., Millner, A. J., Forgeard, M. J. C., Fried, E. I., Hsu, K. J., Treadway, M. T., Leonard, C. V., Kertz, S. J., & Björgvinsson, T. (2016) · Psychological Medicine · doi:10.1017/s0033291716002300 · Cited by 929
A comparison of two techniques for bibliometric mapping: Multidimensional scaling and VOS
van Eck, N. J., Waltman, L., Dekker, R., & van den Berg, J. (2010) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21421 · Cited by 888
Efficient, High-Quality Force-Directed Graph Drawing
Hu, Y. (2006) · The Mathematica Journal · Cited by 877
Single-cell reconstruction of developmental trajectories during zebrafish embryogenesis
Farrell, J. A., Wang, Y., Riesenfeld, S. J., Shekhar, K., Regev, A., & Schier, A. F. (2018) · Science · doi:10.1126/science.aar3131 · Cited by 876
Quantile Connectedness: Modeling Tail Behavior in the Topology of Financial Networks
Ando, T., Greenwood-Nimmo, M., & Shin, Y. (2022) · Management Science · doi:10.1287/mnsc.2021.3984 · Cited by 822
“The layout of all four graphs is identical and is determined using the force-directed algorithm of Fruchterman and Reingold (1991) applied at the conditional mean.”
MethodStatistical strategies for avoiding false discoveries in metabolomics and related experiments
Broadhurst, D. I., & Kell, D. B. (2007) · Metabolomics · doi:10.1007/s11306-006-0037-z · Cited by 817
“Its application to graph drawing was noted by Kruskal and Seery (1980), and has since been used by many others (e.g., Eades, 1984; Ebbels et al., 2006; Fruchterman and Reingold, 1991; Kim et al., 2001)).”
MethodA new method for constructing networks from binary data
van Borkulo, C. D., Borsboom, D., Epskamp, S., Blanken, T. F., Boschloo, L., Schoevers, R. A., & Waldorp, L. J. (2014) · Scientific Reports · doi:10.1038/srep05918 · Cited by 757
mgm: Estimating Time-Varying Mixed Graphical Models in High-Dimensional Data
Haslbeck, J. M. B., & Waldorp, L. J. (2020) · Journal of Statistical Software · doi:10.18637/jss.v093.i08 · Cited by 746
“The layout was computed with the Fruchterman Reingold algorithm (Fruchterman and Reingold 1991), which places nodes such that all the edges are of more or less equal length and there are as few crossing edges as possible.”
MethodCLANS: a Java application for visualizing protein families based on pairwise similarity
Frickey, T., & Lupas, A. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth444 · Cited by 744
Deconstructing the construct: a network perspective on psychological phenomena
Schmittmann, V. D., Cramer, A. O. J., Waldorp, L. J., Epskamp, S., Kievit, R. A., & Borsboom, D. (2013) · New Ideas in Psychology · doi:10.1016/j.newideapsych.2011.02.007 · Cited by 740
“3, we used an algorithm for the placement of the nodes, which causes strongly correlated sets of items to cluster together (Fruchterman & Reingold, 1991).”
MethodThe fecal metabolome as a functional readout of the gut microbiome
Zierer, J., Jackson, M. A., Kastenmüller, G., Mangino, M., Long, T., Telenti, A., Mohney, R. P., Small, K. S., Bell, J. T., Steves, C. J., et al. (2018) · Nature Genetics · doi:10.1038/s41588-018-0135-7 · Cited by 733
Network Analysis in Public Health: History, Methods, and Applications
Luke, D. A., & Harris, J. K. (2007) · Annual Review of Public Health · doi:10.1146/annurev.publhealth.28.021406.144132 · Cited by 709
Social structure of Facebook networks
Traud, A. L., Mucha, P. J., & Porter, M. A. (2012) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2011.12.021 · Cited by 707
“We place the communities using a Fruchterman–Reingold [31] layout, and we use a Kamada–Kawaii [53] layout to position the nodes within communities [54].”
The First Two Decades of Smart-City Research: A Bibliometric Analysis
Mora, L., Bolici, R., & Deakin, M. (2017) · Journal of Urban Technology · doi:10.1080/10630732.2017.1285123 · Cited by 684
“This graph has been obtained using the Fruchterman-Reingold layout algorithm provided by the open-source software Gephi (Fruchterman and Reingold, 1991).”
MethodHierarchical modularity in human brain functional networks
Meunier, D. (2009) · Frontiers in Neuroinformatics · doi:10.3389/neuro.11.037.2009 · Cited by 667
“(C) Topological representation of the network in using Fruchterman–Reingold algorithm (Fruchterman and Reingold, 1991) to highlight topological proximity of highly connected nodes; colour and shape of the nodes represent their modular assignment and topological role as above and in Figure 2.”
InfluentialRevealing the vectors of cellular identity with single-cell genomics
Wagner, A., Regev, A., & Yosef, N. (2016) · Nature Biotechnology · doi:10.1038/nbt.3711 · Cited by 632
Haslbeck, J. M. B., & Waldorp, L. J. (2018) · Behavior Research Methods · doi:10.3758/s13428-017-0910-x · Cited by 630
“layout="spring" specifies that the placement of the nodes in the visualization is determined by the force-directed Fruchtermann-Reingold algorithm [18], which places nodes such that all edges have more or less equal length and that there are as few edge crossings as possible.”
MethodVisualization of omics data for systems biology
Gehlenborg, N., O'Donoghue, S. I., Baliga, N. S., Goesmann, A., Hibbs, M. A., Kitano, H., Kohlbacher, O., Neuweger, H., Schneider, R., Tenenbaum, D., et al. (2010) · Nature Methods · doi:10.1038/nmeth.1436 · Cited by 620
“For small, simple networks, visualized as a graph in which each node represents a protein and each edge represents an interaction between two proteins, the arrangement of proteins and complexes can usually be seen clearly using a standard 'force-directed' layou”
MethodBiochemical Oscillations and Cellular Rhythms: The Molecular Bases of Periodic and Chaotic Behaviour
Goldbeter, A., & Berridge, M. J. (1996) · Cambridge University Press eBooks · doi:10.1017/cbo9780511608193 · Cited by 608
NetCoMi: network construction and comparison for microbiome data in R
Peschel, S., Müller, C. L., von Mutius, E., Boulesteix, A.-L., & Depner, M. (2021) · Briefings in Bioinformatics · doi:10.1093/bib/bbaa290 · Cited by 604
“Node positions are defined using the Fruchterman-Reingold algorithm [110].”
Mental Disorders as Causal Systems: A Network Approach to Posttraumatic Stress Disorder
McNally, R. J., Robinaugh, D. J., Wu, G. W. Y., Wang, L., Deserno, M. K., & Borsboom, D. (2015) · Clinical Psychological Science · doi:10.1177/2167702614553230 · Cited by 592
“The qgraph package implements Fruchterman and Reingold’s (1991) algorithm, which positions nodes with stronger correlations near the center of the network and those with weaker correlations near the periphery of the network.”
MethodThe Small World of Psychopathology
Borsboom, D., Cramer, A. O. J., Schmittmann, V. D., Epskamp, S., & Waldorp, L. J. (2011) · PLoS ONE · doi:10.1371/journal.pone.0027407 · Cited by 591
“To visualize this network structure, we employed a node positioning algorithm with the R-package igraph [19] which leads more strongly connected sets of nodes to cluster closer together [20].”
MethodPredicting the Political Alignment of Twitter Users
Conover, M. D., Goncalves, B., Ratkiewicz, J., Flammini, A., & Menczer, F. (2011) · 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing · doi:10.1109/passat/socialcom.2011.34 · Cited by 588
Janssen, M. A., Schoon, M. L., Ke, W., & Börner, K. (2006) · Global Environmental Change · doi:10.1016/j.gloenvcha.2006.04.001 · Cited by 574
The evolution of sentiment analysis—A review of research topics, venues, and top cited papers
Mäntylä, M. V., Graziotin, D., & Kuutila, M. (2018) · Computer Science Review · doi:10.1016/j.cosrev.2017.10.002 · Cited by 558
Social network analysis: A methodological introduction
Butts, C. T. (2008) · Asian Journal of Social Psychology · doi:10.1111/j.1467-839x.2007.00241.x · Cited by 546
“Examples of such schemes include the Fruchterman-Reingold (Fruchterman & Reingold, 1991) and Kamada-Kawai algorithms (Kamada & Kawai, 1989), both of which may be found in common network visualization and analysis packages (Butts, 2000; Batagelj & Mrvar, 2007; Borgatti, 2007).”
MethodSlow dynamics and high variability in balanced cortical networks with clustered connections
Litwin-Kumar, A., & Doiron, B. (2012) · Nature Neuroscience · doi:10.1038/nn.3220 · Cited by 539
Communities in NetworksPreprint
Porter, M. A., Onnela, J.-P. “., & Mucha, P. J. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0902.3788 · Cited by 536
“.” 5 6 7 11 17 1 2 3 4 8 12 13 14 18 20 22 16 15 10 9 19 21 23 27 30 31 33 34 24 25 26 28 29 32 Fig. 0.2. (Left) The Zachary karate club network [131], visualized using the FruchtermanReingold method [45]. Nodes are colored black or white depending on their later club affiliation (after a disagreement prompted the organ…”
MethodInfluentialGolino, H., Shi, D., Christensen, A. P., Garrido, L. E., Nieto, M. D., Sadana, R., Thiyagarajan, J. A., & Martinez-Molina, A. (2020) · Psychological Methods · doi:10.1037/met0000255 · Cited by 532
Risk preference shares the psychometric structure of major psychological traits
Frey, R., Pedroni, A., Mata, R., Rieskamp, J., & Hertwig, R. (2017) · Science Advances · doi:10.1126/sciadv.1701381 · Cited by 526
“The network was generated using a force-directed algorithm such that correlated nodes (that is, risk-takingmeasures) attracted each other and uncorrelated nodes repulsed each other (54).”
MethodForce‐Directed Edge Bundling for Graph Visualization
Holten, D., & Van Wijk, J. J. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01450.x · Cited by 522
Time- and memory-efficient genome assembly with Raven
Vaser, R., & Šikić, M. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00073-4 · Cited by 522
“Given the quadratic time complexity O (| V | 2 ) 14 and an approximate of 100 iterations until convergence, we shrink the graph by creating unitigs (paths in the graph consisting of vertices with only one ingoing and one outgoing edge) that are 42 vertices away from any junction vertex (vertices…”
BackgroundVANTED: A system for advanced data analysis and visualization in the context of biological networks
Junker, B. H., Klukas, C., & Schreiber, F. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-109 · Cited by 519
A Comparison of U.S. and European University-Industry Relations in the Life Sciences
Owen-Smith, J., Riccaboni, M., Pammolli, F., & Powell, W. W. (2002) · Management Science · doi:10.1287/mnsc.48.1.24.14275 · Cited by 516
Reporting standards for psychological network analyses in cross-sectional data.
Burger, J., Isvoranu, A.-M., Lunansky, G., Haslbeck, J. M. B., Epskamp, S., Hoekstra, R. H. A., Fried, E. I., Borsboom, D., & Blanken, T. F. (2023) · Psychological Methods · doi:10.1037/met0000471 · Cited by 516
Visual Analysis of Large Graphs: State‐of‐the‐Art and Future Research Challenges
von Landesberger, T., Kuijper, A., Schreck, T., Kohlhammer, J., van Wijk, J. J., Fekete, J. ‐., & Fellner, D. W. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01898.x · Cited by 515
Grewal, R., Lilien, G. L., & Mallapragada, G. (2006) · Management Science · doi:10.1287/mnsc.1060.0550 · Cited by 506
“We used the Fruchterman and Reingold (1991) algorithm in the network software package Pajek 1.”
MethodPower and Position in the World City System
Alderson, A. S., & Beckfield, J. (2004) · American Journal of Sociology · doi:10.1086/378930 · Cited by 502
Analyzing (social media) networks with NodeXL
Smith, M. A., Shneiderman, B., Milic-Frayling, N., Mendes Rodrigues, E., Barash, V., Dunne, C., Capone, T., Perer, A., & Gleave, E. (2009) · Proceedings of the fourth international conference on Communities and technologies · doi:10.1145/1556460.1556497 · Cited by 500
“Layouts include a force-directed Fruchterman-Reingold layout [10], that attempts to dynamically find a layout that clusters tightly connected nodes near one another as well as simple geometric layouts like circles or grids.”
BackgroundA Longitudinal Big Data Approach for Precision Health
Schüssler-Fiorenza Rose, S. M., Contrepois, K., Moneghetti, K. J., Zhou, W., Mishra, T., Mataraso, S., Dagan-Rosenfeld, O., Ganz, A. B., Dunn, J., Hornburg, D., et al. (2019) · Nature Medicine · doi:10.1038/s41591-019-0414-6 · Cited by 494
Moody, J., McFarland, D., & Bender‐deMoll, S. (2005) · American Journal of Sociology · doi:10.1086/421509 · Cited by 493
“The two most common layout algorithms are Kamada Kawai (KK; Kamada and Kawai 1989) and Fruchterman Reingold (FR; Fruchterman and Reingold 1991).”
MethodAnchor-Free Distributed Localization in Sensor Networks
Priyantha, N. B., Balakrishnan, H., Demaine, E. D., & Teller, S. J. (2003) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 487
Using Network Analysis to Identify Central Symptoms of Adolescent Depression
Mullarkey, M. C., Marchetti, I., & Beevers, C. G. (2019) · Journal of Clinical Child & Adolescent Psychology · doi:10.1080/15374416.2018.1437735 · Cited by 484
“In our study, the network nodes were displaced in accordance to the force-directed placement algorithm (Fruchterman & Reingold, 1991), whereby nodes that are stronger and/or more connected are preferentially located in the center of the network, whereas less strong and/or less connected nodes are…”
MethodDrawing graphs nicely using simulated annealing
Davidson, R., & Harel, D. (1996) · ACM Transactions on Graphics · doi:10.1145/234535.234538 · Cited by 483
Alexander-Bloch, A. F., Gogtay, N., Meunier, D., Birn, R., Clasen, L., Lalonde, F., Lenroot, R., Giedd, J., & Bullmore, E. T. (2010) · Frontiers in Systems Neuroscience · doi:10.3389/fnsys.2010.00147 · Cited by 480
Cramer, A. O. J., Van Der Sluis, S., Noordhof, A., Wichers, M., Geschwind, N., Aggen, S. H., Kendler, K. S., & Borsboom, D. (2012) · European Journal of Personality · doi:10.1002/per.1866 · Cited by 477
Cell type atlas and lineage tree of a whole complex animal by single-cell transcriptomics
Plass, M., Solana, J., Wolf, F. A., Ayoub, S., Misios, A., Glažar, P., Obermayer, B., Theis, F. J., Kocks, C., & Rajewsky, N. (2018) · Science · doi:10.1126/science.aaq1723 · Cited by 474
Social Network Analysis with sna
Butts, C. T. (2008) · Journal of Statistical Software · doi:10.18637/jss.v024.i06 · Cited by 468
“Network visualization has been a fundamental aspect of social network analysis since its inception ( Freeman 2004 ), and this functionality is an important feature of sna.”
InfluentialNovák, P., Neumann, P., & Macas, J. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-378 · Cited by 458
Dynamics of Political Polarization
Baldassarri, D., & Bearman, P. (2007) · American Sociological Review · doi:10.1177/000312240707200507 · Cited by 455
Network visualization and analysis of gene expression data using BioLayout Express3D
Theocharidis, A., van Dongen, S., Enright, A. J., & Freeman, T. C. (2009) · Nature Protocols · doi:10.1038/nprot.2009.177 · Cited by 454
Graphviz and Dynagraph — Static and Dynamic Graph Drawing Tools
Ellson, J., Gansner, E. R., Koutsofios, E., North, S. C., & Woodhull, G. (2004) · Mathematics and Visualization · doi:10.1007/978-3-642-18638-7_6 · Cited by 438
“A second symmetric layout is provided which implements several of the spring-based force models described in Chapter 2. For large graphs, it relies on dynamic bins, an extension of the technique proposed by Fruchterman and Reingold [ 14 ], to approximate long distance repulsive forces, thereby reducing the running tim…”
MethodPathways for horizontal gene transfer in bacteria revealed by a global map of their plasmids
Redondo-Salvo, S., Fernández-López, R., Ruiz, R., Vielva, L., de Toro, M., Rocha, E. P. C., Garcillán-Barcia, M. P., & de la Cruz, F. (2020) · Nature Communications · doi:10.1038/s41467-020-17278-2 · Cited by 433
The Corner and the Crew: The Influence of Geography and Social Networks on Gang Violence
Papachristos, A. V., Hureau, D. M., & Braga, A. A. (2013) · American Sociological Review · doi:10.1177/0003122413486800 · Cited by 432
Email as Spectroscopy: Automated Discovery of Community Structure within Organizations
Tyler, J. R., Wilkinson, D. M., & Huberman, B. A. (2003) · Communities and Technologies · doi:10.1007/978-94-017-0115-0_5 · Cited by 425
A Network Approach to Psychosis: Pathways Between Childhood Trauma and Psychotic Symptoms
Isvoranu, A.-M., van Borkulo, C. D., Boyette, L.-L., Wigman, J. T. W., Vinkers, C. H., Borsboom, D., & Group Investigators (2017) · Schizophrenia Bulletin · doi:10.1093/schbul/sbw055 · Cited by 397
Fake news detection on social media using geometric deep learning
Monti, F., Frasca, F., Eynard, D., Mannion, D., & Bronstein, M. M. (2019) · arXiv · doi:10.48550/arxiv.1902.06673 · Cited by 392
Mora, L., Deakin, M., & Reid, A. (2019) · Technological Forecasting and Social Change · doi:10.1016/j.techfore.2018.07.035 · Cited by 387
“The collaborative model adopted in each of the smart city development strategies is graphically visualized by using the open-source software Gephi (Version 0.9.1) and its FruchtermanReingold layout algorithm (Fruchterman and Reingold 1991).”
MethodInfluentialMuxViz: a tool for multilayer analysis and visualization of networks
De Domenico, M., Porter, M. A., & Arenas, A. (2015) · Journal of Complex Networks · doi:10.1093/comnet/cnu038 · Cited by 379
“Specifically, we first apply the Fruchterman-Reingold algorithm [45] to the aggregated network and then use the output of this algorithm as a seed layout for the Kamada-Kawai algorithm [46] to achieve a better spatial separation of nodes in the fi-nal layout.”
MethodToward a formalized account of attitudes: The Causal Attitude Network (CAN) model.
Dalege, J., Borsboom, D., van Harreveld, F., van den Berg, H., Conner, M., & van der Maas, H. L. J. (2016) · Psychological Review · doi:10.1037/a0039802 · Cited by 373
Revealing the dynamic network structure of the Beck Depression Inventory-II
Bringmann, L. F., Lemmens, L. H. J. M., Huibers, M. J. H., Borsboom, D., & Tuerlinckx, F. (2015) · Psychological Medicine · doi:10.1017/s0033291714001809 · Cited by 371
“In the visually presented network, symptoms that are more strongly related to each other tend to be closer together in the figure (this is a result of the node placement algorithm; see Fruchterman & Reingold, 1991; Epskamp et al. 2012).”
BackgroundGlobal Survey of Antibiotic Resistance Genes in Air
Li, J., Cao, J., Zhu, Y.-G., Chen, Q.-L., Shen, F., Wu, Y., Xu, S., Fan, H., Da, G., Huang, R.-J., et al. (2018) · Environmental Science & Technology · doi:10.1021/acs.est.8b02204 · Cited by 371
Armour, C., Fried, E. I., Deserno, M. K., Tsai, J., & Pietrzak, R. H. (2017) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2016.11.008 · Cited by 356
network: A Package for Managing Relational Data in R
Butts, C. T. (2008) · Journal of Statistical Software · doi:10.18637/jss.v024.i02 · Cited by 354
Evidence that psychopathology symptom networks have limited replicability.
Forbes, M. K., Wright, A. G. C., Markon, K. E., & Krueger, R. F. (2017) · Journal of Abnormal Psychology · doi:10.1037/abn0000276 · Cited by 354
“Another unreliable characteristic in the association networks was the placement of the nodes and their proximity to one another based on the Fruchterman and Reingold (1991) algorithm.”
BackgroundMethodInfluentialMicrobial diversity in European alpine permafrost and active layers
Frey, B., Rime, T., Phillips, M., Stierli, B., Hajdas, I., Widmer, F., & Hartmann, M. (2016) · FEMS Microbiology Ecology · doi:10.1093/femsec/fiw018 · Cited by 352
HARP: Hierarchical Representation Learning for Networks
Chen, H., Perozzi, B., Hu, Y., & Skiena, S. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11849 · Cited by 349
Atlas of clinically distinct cell states and ecosystems across human solid tumors
Luca, B. A., Steen, C. B., Matusiak, M., Azizi, A., Varma, S., Zhu, C., Przybyl, J., Espín-Pérez, A., Diehn, M., Alizadeh, A. A., et al. (2021) · Cell · doi:10.1016/j.cell.2021.09.014 · Cited by 344
Metadata
- Authors
- Fruchterman, T. M. J., & Reingold, E. M.
- Affiliations
- University of Illinois Urbana-Champaign (US)
- Venue
- Software: Practice and Experience
- Publisher
- Wiley
- Published
- 1991-11
- Volume
- 21
- Issue
- 11
- Pages
- 1129-1164
- ISSN
- 0038-0644 (ISSN-L)
- 1097-024X
- OpenAlex
- W2167482691
- Cited by
- 6,352
- References
- 19
- Citations by year
- 2026: 283 · 2025: 430 · 2024: 451 · 2023: 474 · 2022: 425 · 2021: 442 · 2020: 456 · 2019: 331 · 2018: 313 · 2017: 290 · 2016: 284 · 2015: 275 · 2014: 246 · 2013: 238 · 2012: 225
- FWCI
- 5.14
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Software Practice and Experience (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Data Visualization and Analytics
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computer Graphics and Visualization Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Graph Theory and Algorithms
- Keywords
- network visualization, force-directed placement, undirected graphs, graph layout algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.