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
Items 801–900 of 1,021
Nachappa, P., Challacombe, J. F., Margolies, D. C., Nechols, J. R., Whitfield, A. E., & Rotenberg, D. (2020) · Frontiers in Plant Science · doi:10.3389/fpls.2020.575564 · Cited by 64
“This layout uses the force-directed layout algorithm of Fruchterman and Reingold to place the network vertices on a plane (Fruchterman and Reingold, 1991).”
MethodChen, S., Ebrahimi, O. V., & Cheng, C. (2025) · Journal of Medical Internet Research · doi:10.2196/70483 · Cited by 64
“Networks were then visualized using the Fruchterman-Reingold algorithm [71].”
Kortemeyer, G., & Nöhl, J. (2025) · Physical Review Physics Education Research · doi:10.1103/physrevphyseducres.21.010136 · Cited by 64
“Lower [45, 54] representations of the correlations between the rubric items, resulting from the initial grading in the top row, as well as the first and second round of refining the rubric on the left and right of the bottom row, respectively.”
Сергеевич, Д. П., Ivanisenko, T., Kolchanov, N. A., & Иванисенко, В. А. (2012) · In Silico Biology · doi:10.3233/isb-2012-0449 · Cited by 64
“The layout algorithms are based on force-directed layout algorithm [8].”
Network analysis of the Íslendinga sögur – the Sagas of Icelanders
Carron, P. M., & Kenna, R. (2013) · The European Physical Journal B · doi:10.1140/epjb/e2013-40583-3 · Cited by 64
International Scientific Collaboration in HIV and HPV: A Network Analysis
Vanni, T., Mesa‐Frias, M., Sánchez-García, R. J., Roesler, R., Schwartsmann, G., Goldani, M. Z., & Foss, A. M. (2014) · PLoS ONE · doi:10.1371/journal.pone.0093376 · Cited by 64
“It is a flexible algorithm that optimizes the arrangement of the nodes in an undirected graph based on the strength (force) of their connection [29].”
BackgroundPutting recommendations on the map: visualizing clusters and relations
Gansner, E. R., Hu, Y., Kobourov, S., & Volinsky, C. T. (2009) · ACM Conference on Recommender Systems (RecSys) · doi:10.1145/1639714.1639784 · Cited by 64
“In the case of TV programs, the importance of a vertex can be determined by the popularity of a show as derived from the total number of viewers or by the number of hours watched by one particular user.”
BackgroundMethodStagars, M. H., Ruff, S. E., Amann, R., & Knittel, K. (2016) · Frontiers in Microbiology · doi:10.3389/fmicb.2015.01511 · Cited by 64
“The network vertices (nodes) were plotted using a Fruchterman and Reingold (1991) force-directed algorithm, which causes an increase in the nodes attraction to each other with increasing similarity between them; the more OTU0.”
MethodVisualizing Confidence in Cluster-Based Ensemble Weather Forecast Analyses
Kumpf, A., Tost, B., Baumgart, M., Riemer, M., Westermann, R., & Rautenhaus, M. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2017.2745178 · Cited by 64
“A force-directed graph layout as proposed by Fruchtermann and Reingold [18] can be used to enforce that members of the same clusters are placed close to each other.”
Methodvon Stockert, S., Fried, E. I., Armour, C., & Pietrzak, R. H. (2017) · Journal of Affective Disorders · doi:10.1016/j.jad.2017.12.043 · Cited by 64
“(Fruchterman and Reingold, 1991); the layout was constrained across the two figures to allow for comparisons.”
BackgroundUncovering temporal structure in hippocampal output patterns
Maboudi, K., Ackermann, E., de Jong, L. W., Pfeiffer, B. E., Foster, D., Diba, K., & Kemere, C. (2018) · eLife · doi:10.7554/elife.34467 · Cited by 62
Billet, K., Houillé, B., de Bernonville, T. D., Besseau, S., Oudin, A., Courdavault, V., Delanoue, G., Guérin, L., Clastre, M., Giglioli‐Guivarc’h, N., et al. (2018) · Frontiers in Plant Science · doi:10.3389/fpls.2018.00798 · Cited by 64
“…al., 2013 41 16.2 Stilbenoid DP4 E-vitisin B 905 799, 359 907 322 Pawlus et al., 2012; Lambert et al., 2013 42 12.15 Stilbenoid DP4 Viniferol E* 923 Fujii et al. (2005) RT, retention time, *tentative assignments based on MS data, UV spectra, elution order available from literature. markers…”
MethodInfluentialState loneliness is associated with emotional hypervigilance in daily life: A network analysis
Meng, J., Wang, X., Wei, D., & Qiu, J. (2020) · Personality and Individual Differences · doi:10.1016/j.paid.2020.110154 · Cited by 57
Drawing a Map of Elections in the Space of Statistical Cultures
Szufa, S., Faliszewski, P., Skowron, P., Slinko, A. M., & Talmon, N. (2020) · Adaptive Agents and Multi-Agents Systems · doi:10.65109/dvqm2845 · Cited by 64
“To compute the embedding, we used the force-directed algorithm of Fruchterman and Reingold [31].”
MethodSocial network analysis methods for exploring SARS-CoV-2 contact tracing data
Nagarajan, K., Muniyandi, M., Palani, B., & Sellappan, S. (2020) · BMC Medical Research Methodology · doi:10.1186/s12874-020-01119-3 · Cited by 64
“Force atlas layout and Fruchterman Reingold layout in Gephi software were used to visualize patient’s networks [30, 31].”
MethodAre We There Yet? A Roadmap of Network Visualization from Surveys to Task Taxonomies
Filipov, V., Arleo, A., & Miksch, S. (2023) · Computer Graphics Forum · doi:10.1111/cgf.14794 · Cited by 63
AmbiguityVis: Visualization of Ambiguity in Graph Layouts
Wang, Y., Shen, Q., Archambault, D., Zhou, Z., Zhu, M., Yang, S., & Qu, H. (2015) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2015.2467691 · Cited by 63
Are Crossings Important for Drawing Large Graphs?
Kobourov, S., Pupyrev, S., & Saket, B. (2014) · Lecture notes in computer science · doi:10.1007/978-3-662-45803-7_20 · Cited by 63
“Classical force-directed methods such as Fruchterman-Reingold[7] and Kamada-Kawai [17], and more recent multiscale variants [10, 12], define and minimize the “energy” of the layout; layouts with minimal energy tend to be aesthetically pleasing and to exhibit symmetries.”
MethodMaps of science as interdisciplinary discourse: co-citation contexts and the role of analogy
Small, H. G. (2009) · Scientometrics · doi:10.1007/s11192-009-0121-z · Cited by 63
Nepusz, T., Sasidharan, R., & Paccanaro, A. (2010) · BMC Bioinformatics · doi:10.1186/1471-2105-11-120 · Cited by 63
Novel Primary Immunodeficiency Candidate Genes Predicted by the Human Gene Connectome
Itan, Y., & Casanova, J. (2015) · Frontiers in Immunology · doi:10.3389/fimmu.2015.00142 · Cited by 63
“We then used the NetworkX python package for complex network analyses and visualizations (14), applying the spring layout function, which estimates the localization of each gene in a two-dimensional space with the Fruchterman–Reingold force-directed algorithm (15).”
MethodPoint Placement by Phylogenetic Trees and its Application to Visual Analysis of Document Collections
Cuadros, A. M., Paulovich, F. V., Minghim, R., & Telles, G. P. (2007) · IEEE Conference on Visual Analytics Science and Technology (VAST) · doi:10.1109/vast.2007.4389002 · Cited by 63
“Our strategy, being capable of constructing a hierarchy from that similarity relationship contributes largely to decrease the loss of information caused by the ‘attraction by distance’ nature of conventional FDP.”
MethodInfluentialDeconstructing the Big Valley Search Space Hypothesis
Ochoa, G., & Veerapen, N. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-30698-8_5 · Cited by 63
“49 accepted aesthetic criteria such as a) distribute the vertices evenly in the frame (a circle in this case), b) minimise edge crossings, c) make edge lengths uniform, and d) reflect inherent symmetry [5].”
BackgroundMethodKratzer, L., Heinz, P., Schennach, R., Knefel, M., Schiepek, G. K., Biedermann, S. V., & Büttner, M. (2020) · Psychological Medicine · doi:10.1017/s0033291720001750 · Cited by 63
Bridging maladaptive social self-beliefs and social anxiety: a network perspective
Heeren, A., Bernstein, E. E., & McNally, R. J. (2020) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2020.102267 · Cited by 60
Reframing Climate-Induced Socio-Environmental Conflicts: A Systematic Review
Scartozzi, C. M. (2021) · International Studies Review · doi:10.1093/isr/viaa064 · Cited by 50
Expert-Augmented computational drug repurposing identified baricitinib as a treatment for COVID-19
Smith, D. P., Oechsle, O., Rawling, M. J., Savory, E., Lacoste, A. M. B., & Richardson, P. J. (2021) · Frontiers in Pharmacology · doi:10.3389/fphar.2021.709856 · Cited by 62
“Upon importing gene sets, networks are automatically constructed using PPIs from a number of databases (Biogrid, STRING, KEGG, SiGNoR, OmniPath) that exist within the knowledge graph, and are spatially arranged using a force-directed layout algorithm (Fruchterman and Reingold, 1991).”
MethodBroniatowski, D. A., Simons, J. R., Gu, J., Jamison, A. M., & Abroms, L. C. (2023) · Science Advances · doi:10.1126/sciadv.adh2132 · Cited by 62
“Similar to this prior work, our networks were displayed using a force-directed layout algorithm ( 88 ).”
MethodPolarization, Partisanship and Junk News Consumption over Social Media in the US
Narayanan, V., Barash, V., Kelly, J., Kollanyi, B., Neudert, L.-M., & Howard, P. N. (2018) · arXiv · doi:10.48550/arxiv.1803.01845 · Cited by 62
“A Fruchterman–Reingold visualization algorithm can be used to represent the patterns of connection between these nodes.(9) It arranges the nodes in a visualization through a centrifugal force that pushes nodes to the edge and a cohesive force that pulls strongly connected nodes together.”
MethodParticle swarm optimization for network-based data classification
Carneiro, M. G., Cheng, R., Zhao, L., & Jin, Y. (2018) · Neural Networks · doi:10.1016/j.neunet.2018.12.003 · Cited by 62
Rapid Multipole Graph Drawing on the GPU
Godiyal, A., Hoberock, J., Garland, M., & Hart, J. C. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00219-9_10 · Cited by 62
“As in the force directed algorithm [ 12 ], we assume that the vertices of a graph G(V;E) are charged particles that repel each other with an inverse-square law, Input: G = (V;E) with initial placements Output: G = (V0;E) with nal placements kdTree constructKDTree(V ) SpawnjVj threads on the GPU ; /* Thread i calculate…”
MethodTerrell, J. E. (2010) · The Journal of Island and Coastal Archaeology · doi:10.1080/15564890903142891 · Cited by 62
““Spring-embedding” (e.g., Figure 2) refers to a way of making network drawings (graphs) as visually intelligible as possible by mathematically treating the edges as if they were metal springs and using energy mini- mization to space the nodes (Fruchterman and Reingold 1991).”
BackgroundBowen, J. L., Byrnes, J. E. K., Weisman, D., & Colaneri, C. (2013) · Frontiers in Microbiology · doi:10.3389/fmicb.2013.00342 · Cited by 62
“Second, we plotted the network of OTUs and salt marsh plots as a graph with marsh plots included as their own nodes using the Fruchterman and Reingold (1991) algorithm for ease of visualization.”
MethodSpillovers and the determinants in Islamic equity markets
Balli, F., de Bruin, A., & Chowdhury, M. I. H. (2019) · The North American Journal of Economics and Finance · doi:10.1016/j.najef.2019.101040 · Cited by 62
Wu, L., Wang, W., Jing, P., Chen, Y., Zhan, F., Shi, Y., & Li, T. (2019) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2019.119391 · Cited by 62
DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality Reduction
Zhu, M., Chen, W., Hu, Y., Hou, Y., Liu, L., & Zhang, K. (2020) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2020.3030447 · Cited by 62
“Representatives include forcedirected algorithms [16,31] and dimensionality reduction methods [34].”
BackgroundMethodInfluentialNice class diagrams admit good design?
Eichelberger, H. (2003) · ACM Symposium on Software Visualization (SoftVis) · doi:10.1145/774833.774857 · Cited by 62
“Of course the area required by an individual class should be minimized [Coleman and Parker 1996; Fruchterman and Reingold 1991] with respect to the contents (name, attributes and method section, further compartments) and the magnitude of classes (see P2, D4 and D5).”
BackgroundInfluentialTrust, Security and Privacy in Global Computing
Seigneur, J.-M. (2005) · Arrow@dit (Dublin Institute of Technology) · Cited by 62
Community Structure in Online Collegiate Social NetworksPreprint
Traud, A. L., Kelsic, E. D., Mucha, P. J., & Porter, M. A. (2008) · arXiv (Cornell University) · Cited by 96
Visualizing Structure and Transitions for Biological Data ExplorationPreprint
Moon, K. R., van Dijk, D., Wang, Z., Gigante, S., Burkhardt, D. B., Chen, W. S., Yim, K., van den Elzen, A. M. G., Hirn, M. J., Coifman, R. R., et al. (2017) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/120378 · Cited by 62
Ali, M., Timsina, J., Western, D., Liu, M., Beric, A., Budde, J., Do, A., Heo, G., Wang, L., Gentsch, J., et al. (2025) · Neuron · doi:10.1016/j.neuron.2025.02.014 · Cited by 61
Chimpanzees behave prosocially in a group-specific manner
van Leeuwen, E. J. C., DeTroy, S. E., Kaufhold, S. P., Dubois, C., Schütte, S., Call, J., & Haun, D. B. M. (2021) · Science Advances · doi:10.1126/sciadv.abc7982 · Cited by 61
“The diagrams were laid out using the Fruchterman-Reingold weighted algorithm (54).”
MethodTwitter data analysis to assess the interest of citizens on the impact of marine plastic pollution
Otero, P., Gago, J., & Quintas, P. (2021) · Marine Pollution Bulletin · doi:10.1016/j.marpolbul.2021.112620 · Cited by 61
Network analysis to identify symptoms clusters and temporal interconnections in oncology patients
Kalantari, E., Kouchaki, S., Miaskowski, C. A., Kober, K. M., & Barnaghi, P. M. (2022) · Scientific Reports · doi:10.1038/s41598-022-21140-4 · Cited by 62
Local acceptance of solar farms: The impact of energy narratives
Scovell, M., McCrea, R., Walton, A., & Poruschi, L. (2023) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2023.114029 · Cited by 62
Forensic analysis of phone call networks
Catanese, S., Ferrara, E., & Fiumara, G. (2012) · Social Network Analysis and Mining · doi:10.1007/s13278-012-0060-1 · Cited by 61
“It is computed using the Fruchterman–Reingold algorithm (Fruchterman and Reingold 1991), in which nodes repel each other and Forensic analysis of phone call networks 21”
MethodA visual analytics approach to dynamic social networks
Federico, P., Aigner, W., Miksch, S., Windhager, F., & Zenk, L. (2011) · International Conference on Knowledge Management and Knowledge Technologies · doi:10.1145/2024288.2024344 · Cited by 61
Soulakis, N. D., Carson, M. B., Lee, Y. J., Schneider, D. H., Skeehan, C. T., & Scholtens, D. M. (2015) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocu017 · Cited by 58
Phillips, R. D., Wilson, S. M., Sun, D., Workgroup, V. M.-A. M., & Morey, R. (2018) · Frontiers in Psychiatry · doi:10.3389/fpsyt.2018.00608 · Cited by 55
“This model utilizes the force-directed Fruchterman-Reingold algorithm to yield easy-to-view networks where edges have similar lengths and overlapping edges do not obstruct visualization (27, 28).”
MethodA systematic mapping on automatic classification of fake news in social media
de Souza, J. V., Gomes, J., Filho, F. M. D. S., de Oliveira, A. M., & de Souza, J. F. (2020) · Social Network Analysis and Mining · doi:10.1007/s13278-020-00659-2 · Cited by 62
The State of the Art in Empirical User Evaluation of Graph Visualizations
Burch, M., Huang, W., Wakefield, M., Purchase, H. C., Weiskopf, D., & Hua, J. (2020) · IEEE Access · doi:10.1109/access.2020.3047616 · Cited by 62
“For the layout of the vertices there are several options like radial, circular, hierarchical [17], or force-directed ones [18] to mention some of a longer list.”
BackgroundMapping music in the palm of your hand, explore and discover your collection
Gulik, V. R., Vignoli, F., & van de Wetering, H. (2004) · TU/e Research Portal · Cited by 61
BioLayoutJava: Versatile Network Visualisation of Structural and Functional Relationships
Goldovsky, L., Cases, I., Enright, A. J., & Ouzounis, C. (2005) · Applied Bioinformatics · doi:10.2165/00822942-200504010-00009 · Cited by 61
Abstractocyte: A Visual Tool for Exploring Nanoscale Astroglial Cells
Mohammed, H., Al-Awami, A. K., Beyer, J., Calì, C., Magistretti, P. J., Pfister, H., & Hadwiger, M. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2017.2744278 · Cited by 61
Relationship Between Innovation and Performance in Private Companies: Systematic Literature Review
Bach, T. M., Dalazen, L. L., da Silva, W. V., Ferraresi, A. A., & da Veiga, C. P. (2019) · SAGE Open · doi:10.1177/2158244019855847 · Cited by 60
Towards a responsible integration of artificial intelligence technology in the construction sector
Pillai, V. S., & Matus, K. (2020) · Science and Public Policy · doi:10.1093/scipol/scaa073 · Cited by 60
Graph Neural Networks for Graph Drawing
Tiezzi, M., Ciravegna, G., & Gori, M. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3184967 · Cited by 60
Costa, L. D. F. (2022) · Journal of Physics Complexity · doi:10.1088/2632-072x/ac54c3 · Cited by 60
Pelofske, E. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb029 · Cited by 61
“Figure 1 shows a visual representation of the Maximum Clique and Maximum Cut of an example random graph, drawn using networkx [62] with fruchterman reingold layout [79].”
Compressed Adjacency Matrices: Untangling Gene Regulatory Networks
Dinkla, K., Westenberg, M. A., & van Wijk, J. J. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.208 · Cited by 60
“Eades was the first to propose a force simulation to lay out graphs [11], after which more elaborate force models were developed [13].”
Rincent, R., Nicolas, S., Bouchet, S., Altmann, T., Brunel, D., Revilla, P., Pintos, R. A. M., Moreno‐González, J., Campo, L., Melchinger, A. E., et al. (2014) · Theoretical and Applied Genetics · doi:10.1007/s00122-014-2379-7 · Cited by 60
Visualizing big network traffic data using frequent pattern mining and hypergraphs
Glatz, E., Mavromatidis, S., Ager, B., & Dimitropoulos, X. A. (2013) · Computing · doi:10.1007/s00607-013-0282-8 · Cited by 60
“For rendering we prefer a force-directed layout that is supported by the GraphViz tool ‘fdp’ implementing the Fruchterman and Reingold algorithm [12].”
MethodEvaluating Partially Drawn Links for Directed Graph Edges
Burch, M., Vehlow, C., Konevtsova, N., & Weiskopf, D. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25878-7_22 · Cited by 60
Mouri, K., Uosaki, N., & Ogata, H. (2018) · Educational Technology & Society · Cited by 60
Xie, C., Xu, W., & Mueller, K. D. (2018) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2865026 · Cited by 60
“A force-directed algorithm [14] is used to make the tree layout compact.”
MethodRegression Adjustments for Estimating the Global Treatment Effect in Experiments with Interference
Chin, A. (2019) · Journal of Causal Inference · doi:10.1515/jci-2018-0026 · Cited by 60
Kinra, A., Beheshti-Kashi, S., Buch, R., Nielsen, T. A. S., & Pereira, F. C. (2020) · Transport Policy · doi:10.1016/j.tranpol.2020.05.026 · Cited by 61
HaplowebMaker and CoMa: Two web tools to delimit species using haplowebs and conspecificity matrices
Spöri, Y., & Flot, J. (2020) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.13454 · Cited by 60
“To spread the haplotypes harmoniously and yield a more legible graph, HaplowebMaker spreads the circles automatically using a force-directed algorithm (Fruchterman & Reingold, 1991); the resulting graph can be further improved manually using the editor integrated into the program.”
MethodLee, S. W., Yuh, W. T., Yang, J. M., Cho, Y.-S., Yoo, I. K., Koh, H. Y., Marshall, D. C., Oh, D., Ha, E. K., Han, M. Y., et al. (2020) · JMIR Medical Informatics · doi:10.2196/20992 · Cited by 60
“The relative positions of nodes and edges were implemented by the Fruchterman-Reingold algorithm [16].”
MethodBogaerts, S., van Woerkom, M., Erbaş, Y., Caluwé, E. D., Garofalo, C., Frowijn, I., Jeandarme, I., Masthoff, E., & Janković, M. (2021) · Frontiers in Psychiatry · doi:10.3389/fpsyt.2021.678895 · Cited by 60
“Generally, green edges indicate a positive association between the variables, red edges represent a negative association between the variables, and the thicker the edges, the stronger the associations (44).”
BackgroundA force-directed algorithm that preserves edge-crossing properties
Bertault, F. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(00)00042-9 · Cited by 60
Visualización y análisis de la estructura científica española: ISI Web of science 1990-2005
Anegón, F. D. M., Herrero-Solana, V., Chinchilla‐Rodríguez, Z., Corera‐Álvarez, E., González-Molina, A., Muñoz-Fernández, F. J., & Herrero-Solana, V. (2006) · El Profesional de la Informacion · doi:10.3145/epi.2006.jul.03 · Cited by 60
Marine ecosystem shifts with deglacial sea-ice loss inferred from ancient DNA shotgun sequencing
Zimmermann, H., Stoof‐Leichsenring, K. R., Dinkel, V., Harms, L., Schulte, L., Hütt, M. ‐., Nürnberg, D., Tiedemann, R., & Herzschuh, U. (2023) · Nature Communications · doi:10.1038/s41467-023-36845-x · Cited by 59
Müller, V. P., & Eichhammer, W. (2023) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2023.113304 · Cited by 60
Faltesek, D., Graalum, E., Breving, B., Knudsen, E., Lucas, J., Young, S., & Zambrano, F. E. V. (2023) · Social Media + Society · doi:10.1177/20563051231194576 · Cited by 59
Dong, Q., Zhao, Y., Ma, X., & Zhou, Y. (2023) · Energy Economics · doi:10.1016/j.eneco.2023.107228 · Cited by 59
Force-Directed Lombardi-Style Graph Drawing
Chernobelskiy, R., Cunningham, K. I., Goodrich, M. T., Kobourov, S., & Trott, L. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-25878-7_31 · Cited by 59
“Fruchterman and Reingold describe a model in which a strong nuclear force attracts two protons within the atomic nucleus at close range, while an electrical force repels them at farther range [17].”
BackgroundRECAST: Telling apart social and random relationships in dynamic networks
de Melo, P. O. S. V., Viana, A. C., Fiore, M., Jaffrès‐Runser, K., Mouël, F. L., Loureiro, A. A. F., Addepalli, L., & Chen, G. (2015) · Performance Evaluation · doi:10.1016/j.peva.2015.01.005 · Cited by 61
Distributed Graph Layout for Sensor Networks
Gotsman, C., & Koren, Y. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31843-9_28 · Cited by 59
Towards usage-based impact metrics: first results from the mesur project.
Bollen, J., Herbert Van De Sompel, A., & Rodriguez, M. A. (2008) · ACM/IEEE Joint Conference on Digital Libraries · doi:10.1145/1378889.1378928 · Cited by 59
“The remaining network is then graphically layed-out according to the FruchtermanReingold heuristic which uses “force-directed” placement to position connected journals in each other’s proximity and minimize connection crossings [9].”
MethodUsing Networks to Visualize and Analyze Process Data for Educational Assessment
Zhu, M., Shu, Z., & von Davier, A. A. (2016) · Journal of Educational Measurement · doi:10.1111/jedm.12107 · Cited by 59
Tulin, M., Pollet, T. V., & Lehmann‐Willenbrock, N. (2018) · Social Science Research · doi:10.1016/j.ssresearch.2018.04.004 · Cited by 60
Martins, C., Lemos, L., Filho, A. N. D. S., Bezerra, T. A., Soares, Í. A. A., Mota, J. G., Bandeira, P. F. R., Mota, J. A. P. S., Tassitano, R. M., & Duncan, M. J. (2020) · American Journal of Human Biology · doi:10.1002/ajhb.23519 · Cited by 59
“The “Fruchterman-Reingold” algorithm was applied so, data were presented in the relative space in which variables with stronger associations remain together, and the less strongly associated variables were repelled from each other (Fruchterman & Reingold, 1991).”
MethodA Widespread Bacterial Secretion System with Diverse Substrates
Grossman, A. S., Mauer, T. J., Forest, K. T., & Goodrich-Blair, H. (2021) · mBio · doi:10.1128/mbio.01956-21 · Cited by 48
“Each node represents a group of highly similar sequences, with edge darkness demonstrating similarity, and the distance between nodes being determined via the Fruchterman-Reingold algorithm to optimize edge lengths (59).”
MethodEffects of Sociogram Drawing Conventions and Edge Crossings in Social Network Visualization
Huang, W., Hong, S., & Eades, P. (2007) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00152 · Cited by 59
A network approach to hypersexuality: insights and clinical implications
Werner, M., Štulhofer, A., Waldorp, L., & Jurin, T. (2018) · The Journal of Sexual Medicine · doi:10.1016/j.jsxm.2018.01.009 · Cited by 58
Maladaptive daydreaming and emotional regulation difficulties: a network analysis
Greene, T., West, M., & Somer, E. (2020) · Psychiatry Research · doi:10.1016/j.psychres.2020.112799 · Cited by 58
“The network layout is based on the Fruchterman-Reingold algorithm which forces strongly correlated nodes closer together (Fruchterman and Reingold, 1991).”
Alibhai, J., Blanco, R. A., Barria, M. A., Piccardo, P., Caughey, B., Perry, V. H., Freeman, T. C., & Manson, J. C. (2016) · PLOS Biology · doi:10.1371/journal.pbio.1002579 · Cited by 56
Network Alignment by Discrete Ollivier-Ricci Flow
Ni, C.-C., Lin, Y.-Y., Gao, J., & Gu, X. D. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-04414-5_32 · Cited by 58
Morrison, S. M., & Hazen, R. M. (2020) · American Mineralogist · doi:10.2138/am-2020-7447 · Cited by 58
“Network graph of stellar and primary nebular minerals The evolutionary system of mineralogy is illustrated using bipartite mineral network graphs (Fruchterman and Reingold 1991; Asratian et al. 1998; Morrison et al. 2017), which display relationships among mineral phases and their attributes, in…”
MethodWang, X., & Hui, L. (2024) · System · doi:10.1016/j.system.2024.103418 · Cited by 58
Kortemeyer, G., Dittmann-Domenichini, N., & Merki, C. (2025) · Discover Education · doi:10.1007/s44217-025-00500-y · Cited by 58
“3 Fruchterman-Reingold [23] representation of the Spearman correlation matrix between the attributes in Table 1 Vol:.”
Viral assemblage composition in Yellowstone acidic hot springs assessed by network analysis
Bolduc, B., Wirth, J., Mazurie, A., & Young, M. (2015) · The ISME Journal · doi:10.1038/ismej.2015.28 · Cited by 58
Integrating Edge Routing into Force-Directed Layout
Dwyer, T., Marriott, K., & Wybrow, M. (2007) · Springer eBooks · doi:10.1007/978-3-540-70904-6_3 · Cited by 58
“Second, since our approach is based on functional majorization it has better convergence properties than the earlier approaches which were solved with iterative local-search methods similar to those introduced by Kamada and Kawai [2] or Fruchterman and Reingold [8].”
MethodBiSet: Semantic Edge Bundling with Biclusters for Sensemaking
Sun, M., Mi, P., North, C. L., & Ramakrishnan, N. (2015) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2015.2467813 · Cited by 58
Schneider, B., & Pea, R. D. (2014) · International Journal of Computer-Supported Collaborative Learning · doi:10.1007/s11412-014-9202-y · Cited by 58
“The first is to provide an alternative approach for exploring eye-tracking data, involving data visualization techniques, such as force-directed graphs (Fruchterman and Reingold 1991).”
MethodCurvilinear Graph Drawing Using the Force-Directed Method
Finkel, B. F., & Tamassia, R. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31843-9_46 · Cited by 58
“Effective force-directed techniques include subatomic forces [12] and simulated annealing [8].”
BackgroundAnalysis of public oral toxicity data from REACH registrations 2008-2014
Luechtefeld, T., Maertens, A., Russo, D. P., Rovida, C., Zhu, H., & Hartung, T. (2016) · ALTEX · doi:10.14573/altex.1510054 · Cited by 58
“The force layout algorithm is used to distribute substances (Fruchterman and Reingold, 1991).”
MethodGouesnard, B., Negro, S. S., Laffray, A., Glaubitz, J. C., Melchinger, A. E., Revilla, P., Moreno‐González, J., Madur, D., Combes, V., Tollon‐Cordet, C., et al. (2017) · Theoretical and Applied Genetics · doi:10.1007/s00122-017-2949-6 · Cited by 58
Evaluating Navigation Techniques for 3D Graph Visualizations in Virtual Reality
Drogemuller, A., Cunningham, A., Walsh, J. A., Cordeil, M., Ross, W., & Thomas, B. H. (2018) · Big Data Visual and Immersive Analytics · doi:10.1109/bdva.2018.8533895 · Cited by 58
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.