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 701–800 of 1,021
D-Dupe: An Interactive Tool for Entity Resolution in Social Networks
Bilgic, M., Licamele, L., Getoor, L. C., & Shneiderman, B. (2006) · IEEE Conference on Visual Analytics Science and Technology (VAST) · doi:10.1109/vast.2006.261429 · Cited by 73
“The collaboration context network shown in Figure 3(b) uses an an off-the-shelf spring embedder method, Fruchterman-Reingold layout [17] algorithm, for laying out the nodes.”
MethodInferring and visualizing social networks on Internet relay chat
Mutton, P. (2004) · doi:10.1109/iv.2004.75 · Cited by 73
Inferring and visualizing social networks on internet relay chat
Mutton, P. (2004) · International Conference on Information Visualisation (IV) · doi:10.1109/iv.2004.1320122 · Cited by 73
Tree rows in temperate agroforestry croplands alter the composition of soil bacterial communities
Beule, L., & Karlovský, P. (2021) · PLoS ONE · doi:10.1371/journal.pone.0246919 · Cited by 72
The VRNetzer platform enables interactive network analysis in Virtual Reality
Pirch, S., Müller, F., Iofinova, E., Pázmándi, J., Hütter, C. V. R., Chiettini, M., Sin, C., Boztuǧ, K., Podkosova, I., Kaufmann, H., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-22570-w · Cited by 72
“Finally, we also included a spring-based layout from a Fruchtermann – Reingold algorithm implementation 49 .”
MethodGuan, M., Liu, J., Li, X., Cai, M., Bi, J., Zhou, P., Wang, Z., Wu, S., Guo, L., & Wang, H. (2024) · BMC Psychiatry · doi:10.1186/s12888-024-05599-1 · Cited by 72
“The nodes with strong connections are located in the center of the network, while the nodes with weak connections are located in the periphery of the network [41].”
BackgroundTree Colors: Color Schemes for Tree-Structured Data
Tennekes, M., & de Jonge, E. (2014) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2014.2346277 · Cited by 72
Improving multiple aesthetics produces better graph drawings
Huang, W., Eades, P., Hong, S.-H., & Lin, C. (2012) · Journal of Visual Languages & Computing · doi:10.1016/j.jvlc.2011.12.002 · Cited by 72
“For example, an algorithm by Fruchterman and Reingold [15] draws graphs following generally accepted aesthetics including evenly distributed vertices, minimized edge crossings and uniform edge lengths.”
MethodThe centrality of DSM and non-DSM depressive symptoms in Han Chinese women with major depression
Kendler, K. S., Aggen, S. H., Flint, J., Borsboom, D., & Fried, E. I. (2018) · Journal of Affective Disorders · doi:10.1016/j.jad.2017.11.032 · Cited by 61
“For node placement in the resulting network graph, we use the Fruchterman-Reingold algorithm (Fruchterman and Reingold, 1991) that iteratively computes the optimal layout so that symptoms with stronger and/or more connections are placed closer to each other; central nodes often end up in the center of the graph, nodes…”
Griffin, L. P., Brownscombe, J. W., Adams, A. J., Boucek, R. E., Finn, J. T., Heithaus, M. R., Rehage, J. S., Cooke, S. J., & Danylchuk, A. J. (2018) · Fisheries Research · doi:10.1016/j.fishres.2018.04.008 · Cited by 72
“The Fruchterman and Reingold force-directed layout algorithm (Fruchterman and Reingold, 1991) was applied on bipartite graphs making attractive and repulsive forces among the regions (nodes) proportional to the weight of the edges connecting adjacent nodes (Finn et al.”
MethodWeiss, N. H., Contractor, A. A., Raudales, A. M., Greene, T., & Short, N. A. (2020) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2020.102198 · Cited by 72
Analysis of Disinformation and Fake News Detection Using Fine-Tuned Large Language ModelPreprint
Павлишенко, Б. М. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2309.04704 · Cited by 71
Yu, C., Schumacher, H. R., & Crane, K. (2021) · ACM Transactions on Graphics · doi:10.1145/3439429 · Cited by 71
“8.3 Graph Drawing A basic problem in data visualization is drawing graphs; a typical approach is to use a force-based layout that seeks to avoid, e.g., collisions between nodes, or over/under-extension of edges [Fruchterman and Reingold 1991].”
MethodInfluentialNeurons Forming Optic Glomeruli Compute Figure–Ground Discriminations in Drosophila
Aptekar, J. W., Keleş, M. F., Lu, P. M., Zolotova, N. M., & Frye, M. A. (2015) · The Journal of Neuroscience · doi:10.1523/jneurosci.0652-15.2015 · Cited by 65
“The graph layout as shown is calculated by the Fruchterman–Reingold algorithm (Fruchterman and Reingold, 1991).”
MethodLeydesdorff, L., de Moya-Anegón, F., & Guerrero-Bote, V. (2013) · J. Assoc. Inf. Sci. Technol. · doi:10.1002/asi.23243 · Cited by 60
“…currently VOSViewer in our opinion is the best choice for two reasons: (a) the problem of cluttering of the labels is solved in VOSViewer, and (b) the layout is based on stress-minimization as in multidimensional scaling (MDS) whereas Gephi uses a spring-embedder (Fruchterman & Reingold, 1991).”
MethodSTREAMIT: Dynamic visualization and interactive exploration of text streams
Alsakran, J., Chen, Y., Zhao, Y., Yang, J., & Luo, D. (2011) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2011.5742382 · Cited by 71
“FDP [7] has O(N(3)) complexity which urges researchers to improve its efficiency in order to achieve better computational performance.”
BackgroundLiu, P., & Conrad, R. (2017) · Environmental Microbiology · doi:10.1111/1462-2920.13698 · Cited by 71
Network Visualization with ggplot2
Tyner, S., Briatte, F., & Hofmann, H. (2017) · The R Journal · doi:10.32614/rj-2017-023 · Cited by 71
“This argument can take any of the layout values supported by the gplot.layout function of the sna package, and defaults to ‘ fruchtermanreingold ’, which places the nodes through the force-directed layout algorithm by Fruchterman and Reingold (1991).”
MethodSantiago, A. L. F., Demajorovic, J., Rossetto, D. E., & Luke, H. (2020) · Resources Policy · doi:10.1016/j.resourpol.2020.101941 · Cited by 71
Shappell, H. M., Duffy, K. A., Rosch, K. S., Pekar, J. J., Mostofsky, S. H., Lindquist, M. A., & Cohen, J. R. (2021) · NeuroImage · doi:10.1016/j.neuroimage.2021.117753 · Cited by 71
Frauenfelder, H., Toroczkai, Z., & Ben-Naim, E. (2004) · Lecture notes in physics · doi:10.1007/b98716 · Cited by 71
Li, H., Rukina, D., David, F. P. A., Li, T. Y., Oh, C., Gao, A. W., Katsyuba, E., Sleiman, M. S. B., Komljenović, A., Huang, Q. D., et al. (2019) · Genome Research · doi:10.1101/gr.251983.119 · Cited by 71
Clustering algorithm for formations in football games
Narizuka, T., & Yamazaki, Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-48623-1 · Cited by 70
“The nodes are placed using Fruchterman-Reingold force-directed algorithm 17 , which achieves an optimal layout depending on the number of transitions between clusters (weight of edges): two nodes with a large number of transitions are placed in nearby locations.”
MethodFlow of online misinformation during the peak of the COVID-19 pandemic in Italy
Caldarelli, G., De Nicola, R., Petrocchi, M., Pratelli, M., & Saracco, F. (2021) · EPJ Data Science · doi:10.1140/epjds/s13688-021-00289-4 · Cited by 54
Ebrahimi, O. V., Burger, J., Hoffart, A., & Johnson, S. U. (2021) · BMC Medicine · doi:10.1186/s12916-021-02179-y · Cited by 71
“The arrangement of the nodes is based on the average layout of the three networks that have been established via the Fruchterman-Reingold algorithm [53].”
MethodAdaptive capacity beyond the household: a systematic review of empirical social-ecological research
Vallury, S., Smith, A. P., Chaffin, B. C., Nesbitt, H. K., Lohani, S., Gulab, S., Banerjee, S., Floyd, T. M., Metcalf, A. L., Metcalf, E. C., et al. (2022) · Environmental Research Letters · doi:10.1088/1748-9326/ac68fb · Cited by 70
A visual analytics approach for understanding biclustering results from microarray data
Santamaría, R., Therón, R., & Quintales, L. A. M. (2008) · BMC Bioinformatics · doi:10.1186/1471-2105-9-247 · Cited by 70
“The nodes are displayed following a force-directed layout [27].”
BackgroundThree dimensional UML using force directed layout
Dwyer, T. (2001) · Cited by 70
Supporting Visual Queries on Medium-Sized Node–Link Diagrams
Ware, C., & Bobrow, R. (2005) · Information Visualization · doi:10.1057/palgrave.ivs.9500090 · Cited by 70
Network analysis of PTSD symptoms following mass violence.
Sullivan, C. P., Smith, A. J., Lewis, M., & Jones, R. T. (2018) · Psychological Trauma: Theory, Research, Practice, and Policy · doi:10.1037/tra0000237 · Cited by 58
Comparing the Readability of Graph Layouts using Eyetracking and Task-oriented Analysis
Pohl, M., Schmitt, M., & Diehl, S. (2009) · Eurographics · doi:10.2312/compaesth/compaesth09/049-056 · Cited by 69
The HIM glocal metric and kernel for network comparison and classification
Jurman, G., Visintainer, R., Filosi, M., Riccadonna, S., & Furlanello, C. (2015) · IEEE International Conference on Data Science and Advanced Analytics (DSAA) · doi:10.1109/dsaa.2015.7344816 · Cited by 71
The role of endogenous and exogenous mechanisms in the formation of R&D networks
Tomasello, M. V., Perra, N., Tessone, C. J., Karsai, M., & Schweitzer, F. (2014) · Scientific Reports · doi:10.1038/srep05679 · Cited by 69
Transdiagnostic Networks: Commentary on Nolen-Hoeksema and Watkins (2011)
Borsboom, D., Epskamp, S., Kievit, R. A., Cramer, A. O. J., & Schmittmann, V. D. (2011) · Perspectives on Psychological Science · doi:10.1177/1745691611425012 · Cited by 61
“The combination of transdiagnostic models and network models opens up a rich palette of quantitative and qualitative individual differences and grounds the observations and conceptual framework in a modeling approach that may ultimately produce both a better understanding and improved interventions.”
The relationship between aerobic fitness level and metabolic profiles in healthy adults
Morris, C., Grada, C. O., Ryan, M., Roche, H. M., De Vito, G., Gibney, M. J., Gibney, E. R., & Brennan, L. (2013) · Molecular Nutrition & Food Research · doi:10.1002/mnfr.201200629 · Cited by 61
A comparative study of social network analysis tools
Combe, D., Largeron, C., Egyed‐Zsigmond, E., & Géry, M. (2010) · HAL · Cited by 69
Afzali, M. H., Sunderland, M., Batterham, P. J., Carragher, N., Calear, A. L., & Slade, T. N. (2016) · Social Psychiatry and Psychiatric Epidemiology · doi:10.1007/s00127-016-1331-3 · Cited by 69
Research Trend Visualization by MeSH Terms from PubMed
Yang, H., & Lee, H. J. (2018) · International Journal of Environmental Research and Public Health · doi:10.3390/ijerph15061113 · Cited by 70
Efficient Node Overlap Removal Using a Proximity Stress Model
Gansner, E. R., & Hu, Y. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00219-9_20 · Cited by 69
“Various authors [2,13,21,26] have extended the spring-electrical model [4,7] to take into account node sizes, usually as increased repulsive forces.”
BackgroundDrawing Huge Graphs by Algebraic Multigrid Optimization
Koren, Y., Carmel, L., & Harel, D. (2003) · Multiscale Modeling and Simulation · doi:10.1137/s154034590241370x · Cited by 69
“Keywords: algebraic multigrid, multiscale/multilevel optimization, graph drawing, generalized eigenvalue problem, Fiedler vector, force directed layout, the Hall energy”
BackgroundVisualising a fund manager flow graph with columns and worms
Dwyer, T., & Eades, P. (2003) · International Conference on Information Visualisation (IV) · doi:10.1109/iv.2002.1028770 · Cited by 69
“[2] use such metrics to create a large graph which is then arranged in the plane using a force directed placement algorithm [3, 5, 6, 10].”
MethodA hybrid layout algorithm for sub-quadratic multidimensional scaling
Morrison, A., Ross, G., & Chalmers, M. (2003) · IEEE Symposium on Information Visualization · doi:10.1109/infvis.2002.1173161 · Cited by 69
“Spring models or force‐directed placement [ 6 ] techniques are amongst the simplest MDS algorithms.”
MethodHigh quality visualization of biochemical pathways in BioPath.
Schreiber, F. (2002) · PubMed · Cited by 69
Shekhar, K., Whitney, I. E., Butrus, S., Peng, Y.-R., & Sanes, J. R. (2022) · eLife · doi:10.7554/elife.73809 · Cited by 68
Ravindran, K., Susarla, A., Mani, D., & Gurbaxani, V. (2015) · Information Systems Research · doi:10.1287/isre.2015.0572 · Cited by 68
Kratzer, L., Knefel, M., Haselgruber, A., Heinz, P., Schennach, R., & Karatzias, T. (2021) · European Archives of Psychiatry and Clinical Neuroscience · doi:10.1007/s00406-021-01342-z · Cited by 68
Cluster analysis of Java dependency graphs
Dietrich, J. B., Yakovlev, V., McCartin, C., Jenson, G. D., & Duchrow, M. (2008) · ACM Symposium on Software Visualization (SoftVis) · doi:10.1145/1409720.1409735 · Cited by 68
“Force directed layout is used to position visual elements of the graph [Fruchterman and Reingold 1991].”
MethodCross-lingual C*ST*RD: English access to Hindi information
Leuski, A., Lin, C.-Y., Zhou, L., Germann, U., Och, F. J., & Hovy, E. H. (2003) · ACM Transactions on Asian Language Information Processing · doi:10.1145/979872.979877 · Cited by 68
Zhang, B., Vogt, M., Maggiora, G. M., & Bajorath, J. (2015) · Journal of Computer-Aided Molecular Design · doi:10.1007/s10822-015-9872-1 · Cited by 68
“The layout of CSNs was derived by applying the Fruchterman–Rheingold algorithm [32] that arranges similar objects into clusters and separates clusters from each other in a force-directed manner for visualization (hence, distances between disconnected clusters in CSNs are layout-determined and not…”
MethodAn Anatomical Interface between Memory and Oculomotor Systems
Shen, K., Bezgin, G., Selvam, R., McIntosh, A. R., & Ryan, J. D. (2016) · Journal of Cognitive Neuroscience · doi:10.1162/jocn_a_01007 · Cited by 69
“As expected, the FEF, superficial layers of the SC, and lateral intraparietal area (LIP) were consistently assigned to the same stream as SCd (≥93.8% of FRLs).”
MethodInfluentialMapping supply chain risk by network analysis of product platforms
Nuss, P., Graedel, T. E., Alonso, E., & Carroll, A. (2016) · Sustainable materials and technologies · doi:10.1016/j.susmat.2016.10.002 · Cited by 68
Lovrić, M., Re, R. D., Vidale, E., Pettenella, D., & Mavsar, R. (2017) · Forest Policy and Economics · doi:10.1016/j.forpol.2017.10.006 · Cited by 68
Lana, R. M., Gomes, M. F. D. C., de Lima, T. F. M., Honório, N. A., & Codeço, C. T. (2017) · PLoS neglected tropical diseases · doi:10.1371/journal.pntd.0006070 · Cited by 68
Geospatial variation in co‐occurrence networks of nitrifying microbial guilds
Jones, C. M., & Hallin, S. (2018) · Molecular Ecology · doi:10.1111/mec.14893 · Cited by 68
“…of OTUs that were infrequently detected across the sites, the final network consisted of 520 nodes and 2,293 edges, with a global network diameter of 18 and an average node degree of 8.8, and was visualized in Cytoscape using the Fruchterman–Reingold algorithm (Fruchterman & Reingold, 1991).”
MethodInfluentialWruk, D., Oberg, A., Klutt, J., & Maurer, I. (2019) · Journal of Business Ethics · doi:10.1007/s10551-019-04209-5 · Cited by 68
“Then we applied the Fruchterman-Reingold algorithm (Fruchterman and Reingold 1991), which positions nodes closely together that often co-occur and are thus strongly connected.”
MethodSaqr, M., Nouri, J., & Jormanainen, I. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-29736-7_35 · Cited by 68
“The libraries Igraph and Cen-tiserve were used to compute the centrality measures and network parameters [34 – 37].”
MethodVisualization of High-Dimensional Data with Relational Perspective Map
Li, J. X. (2004) · Information Visualization · doi:10.1057/palgrave.ivs.9500051 · Cited by 68
Bőthe, B., Lonza, A., Štulhofer, A., & Demetrovics, Z. (2020) · The Journal of Sexual Medicine · doi:10.1016/j.jsxm.2020.05.030 · Cited by 67
#Tarifazo. Medios tradicionales y fusión de agenda en redes sociales
Calvo, E., & Aruguete, N. (2018) · InMediaciones de la Comunicación · doi:10.18861/ic.2018.13.1.2831 · Cited by 67
Datta, M. S., Almada, A. A., Baumgartner, M. F., Mincer, T. J., Tarrant, A. M., & Polz, M. F. (2018) · The ISME Journal · doi:10.1038/s41396-018-0182-1 · Cited by 67
Shi, W., Fu, H., Wang, P., Chen, C., & Xiong, J. (2020) · International Journal of Environmental Research and Public Health · doi:10.3390/ijerph17031062 · Cited by 67
“The network spatialization was conducted with Gephi’s built-in force-directed layout algorithm proposed by Fruchterman and Reingold [83], where the more associated the hashtags, the closer they are to each other in the spatial layout.”
MethodEmbeddings-Based Clustering for Target Specific Stances: The Case of a Polarized Turkey
Rashed, A. A.-A., Kutlu, M., Darwish, K. M., Elsayed, T., & Bayrak, C. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v15i1.18082 · Cited by 67
Mining and visualizing developer networks from version control systems
Jermakovics, A., Sillitti, A., & Succi, G. (2011) · International Workshop on Cooperative and Human Aspects of Software Engineering (CHASE) · doi:10.1145/1984642.1984647 · Cited by 68
“We apply Fruchterman-Reingold [12] force-directed graph layout to the constructed network by setting the link lengths to developer dissimilarity in order to place similar developers together and dissimilar ones apart.”
MethodBrushing of Attribute Clouds for the Visualization of Multivariate Data
Jänicke, H., Böttinger, M., & Scheuermann, G. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.116 · Cited by 67
“From the large variety of existing layout algorithms we chose the force-directed layout algorithm by Fruchterman and Reingold [ 6 ].”
MethodUdrescu, L., Sbârcea, L., Topîrceanu, A., Iovanovici, A., Kurunczi, L., Bogdan, P., & Udrescu, M. (2016) · Scientific Reports · doi:10.1038/srep32745 · Cited by 67
Wang, Y., Wang, Y., Sun, Y., Zhu, L., Lu, K., Fu, C., Sedlmair, M., Deußen, O., & Chen, B. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2017.2745919 · Cited by 67
“This approach is built upon a spring-electrical model [18, 21]; it treats edges as springs and nodes as charged particles, and simulates repulsive forces between all pairs of nodes and attractive forces between adjacent nodes.”
Bibliometric Delineation of Scientific Fields
Zitt, M., Lelu, A., Cadot, M., & Cabanac, G. (2019) · Springer handbooks · doi:10.1007/978-3-030-02511-3_2 · Cited by 67
Cooperative Changes in Solvent Exposure Identify Cryptic Pockets, Switches, and Allosteric Coupling
Porter, J. R., Moeder, K. E., Sibbald, C. A., Zimmerman, M. I., Hart, K. M., Greenberg, M. J., & Bowman, G. R. (2019) · Biophysical Journal · doi:10.1016/j.bpj.2018.11.3144 · Cited by 67
“Graphs were embedded with Fruchterman-Reingold algorithm (43) in NetworkX (36).”
MethodWatanabe, N. M., Kim, J., & Park, J. (2020) · Journal of Retailing and Consumer Services · doi:10.1016/j.jretconser.2020.102301 · Cited by 67
Metcalfe, K. S., Murali, R., Mullin, S. W., Connon, S. A., & Orphan, V. J. (2020) · The ISME Journal · doi:10.1038/s41396-020-00757-1 · Cited by 68
“A network diagram in which nodes represent OTUs and edges between nodes 260 represent correlations was constructed with force-directed methods [76], where edge length 261 varied in inverse proportion to correlation strength.”
MethodMeasuring and profiling the topical influence and sentiment contagion of public event stakeholders
An, L., Zhou, W., Ou, M., Li, G., Yu, C., & Wang, X. (2021) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2021.102327 · Cited by 67
Gonçalves, A. P., Zuanazzi, A. C., Salvador, A. P., Jaloto, A., Pianowski, G., & Carvalho, L. D. F. (2020) · Archives of Psychiatry and Psychotherapy · doi:10.12740/app/122576 · Cited by 66
Betz, L. T., Penzel, N., Kambeitz‐Ilankovic, L., Rosen, M., Chisholm, K., Stainton, A., Haidl, T. K., Wenzel, J., Bertolino, A., Borgwardt, S., et al. (2020) · Schizophrenia · doi:10.1038/s41537-020-00129-w · Cited by 67
Quantum feature maps for graph machine learning on a neutral atom quantum processor
Albrecht, B., Dalyac, C., Leclerc, L., Ortiz-Gutiérrez, L., Thabet, S., D'Arcangelo, M., Cline, J., Elfving, V. E., Lassablière, L., Silvério, H., et al. (2023) · Physical Review A · doi:10.1103/physreva.107.042615 · Cited by 66
“Starting from a Reingold-Fruchterman layout [54], our optimizer minimizes the average distance between two connected nodes while maximizing the distances between unconnected nodes.”
MethodNovel integrative genomic tool for interrogating lithium response in bipolar disorder
Hunsberger, J. G., Chibane, F. L., Elkahloun, A. G., Henderson, R., Singh, R., Lawson, J., Cruceanu, C., Nagarajan, V., Turecki, G., Squassina, A., et al. (2015) · Translational Psychiatry · doi:10.1038/tp.2014.139 · Cited by 66
Current innovations and future challenges of network motif detection
Tran, N. T., Mohan, S., Xu, Z., & Huang, C. (2014) · Briefings in Bioinformatics · doi:10.1093/bib/bbu021 · Cited by 66
An advanced network visualization system for financial crime detection
Didimo, W., Liotta, G., Montecchiani, F., & Palladino, P. (2011) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2011.5742391 · Cited by 66
“The drawing algorithm implemented in VISFAN is a force-directed technique whose basic physical model is inspired to that proposed by Fruchterman and Reingold [ 26 ].”
MethodPancho, D. P., Alonso, J. M., Cordón, Ó., Quirin, A., & Magdalena, L. (2013) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2013.2245130 · Cited by 66
Ruff, S. E., Kuhfuß, H., Wegener, G., Lott, C., Ramette, A., Wiedling, J., Knittel, K., & Weber, M. (2016) · Frontiers in Microbiology · doi:10.3389/fmicb.2016.00374 · Cited by 66
“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.”
MethodConsistency of animal social networks after disturbance
Formica, V. A., Wood, C. W., Cook, P. A., & Brodie, E. D. (2016) · Behavioral Ecology · doi:10.1093/beheco/arw128 · Cited by 66
“The visualizations were constructed using the Fuchterman–Reingold method in iGraph for R (Csardi and Nepusz 2006; Fruchterman and Reingold 1991), which essentially pulls nodes that are highly connected closer together.”
MethodIntraindividual Dynamic Network Analysis – Implications for Clinical Assessment
David, S. J., Marshall, A. J., Evanovich, E. K., & Mumma, G. H. (2018) · Journal of Psychopathology and Behavioral Assessment · doi:10.1007/s10862-017-9632-8 · Cited by 59
“Nodes with stronger partial relations appear in the center of the network while those with weaker associations appear on the periphery (Fruchterman & Reingold, 1991).”
BackgrounddimRed and coRanking - Unifying Dimensionality Reduction in R
Kraemer, G., Reichstein, M., & Miguel, D. M. (2018) · The R Journal · doi:10.32614/rj-2018-039 · Cited by 66
“This is why a number of methods have been developed that try to deal with some of the shortcomings, for example, the Kamada-Kawai (Kamada and Kawai, 1989), the Fruchtermann-Reingold (Fruchterman and Reingold, 1991), or the DrL (Martin et al., 2007) algorithms.”
Papageorgiou, K. Α., Benini, E., Bilello, D., Gianniou, F., Clough, P., & Costantini, G. (2019) · Journal of Personality · doi:10.1111/jopy.12472 · Cited by 66
Medical record linkage in health information systems by approximate string matching and clustering
Sauleau, E., Paumier, J.-P., & Buémi, A. (2005) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-5-32 · Cited by 66
Human–Computer Interactive Annealing for Discovering Invisible Dark Events
Maeno, Y., & Ohsawa, Y. (2007) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2007.891661 · Cited by 66
“KeyGraph employs a force-direct placement technique to draw a graph [ 14 ], [15].”
MethodBuilding virtual cities: applying urban planning principles to the design of virtual environments
Ingram, R., Benford, S., & Bowers, J. (1996) · ACM Symposium on Virtual Reality Software and Technology (VRST) · doi:10.1145/3304181.3304199 · Cited by 66
Schilling, S., Armaou, M., Morrison, Z., Carding, P. N., Bricknell, M. C. M., & Connelly, V. J. (2022) · PLoS ONE · doi:10.1371/journal.pone.0272942 · Cited by 65
“The resulting network between themes was graphically visualised using the Fruchterman Reingold layout algorithm [44, 45] and the computation and visualization of the average weighted degree and modularity of nodes (representing clusters of nodes which themes are more closely related to each other on the basis of shari…”
MethodVisualizing social network concepts
Zhu, B., Watts, S. A., & Chen, H. (2010) · Decision Support Systems · doi:10.1016/j.dss.2010.02.001 · Cited by 65
“Instead, understanding these network concepts requires users to synthesize visual features [9,14] or information from multiple views [15,16,29] into a mental representation of the desired concept's meaning.”
BackgroundMethodResultRolled‐out Wordles: A Heuristic Method for Overlap Removal of 2D Data Representatives
Strobelt, H., Spicker, M., Stoffel, A., Keim, D. A., & Deußen, O. (2012) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2012.03106.x · Cited by 65
Visualizing Dynamic Data with Maps
Mashima, D., Kobourov, S., & Hu, Y. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.288 · Cited by 65
Visualization methods for longitudinal social networks and stochastic actor-oriented modeling
Brandes, U., Indlekofer, N., & Mader, M. (2011) · Social Networks · doi:10.1016/j.socnet.2011.06.002 · Cited by 64
“The simplest (and most common) approaches to take stability into account are based on variants of the spring embedders of Fruchterman and Reingold (1991) or Kamada and Kawai (1988), in which the iterative computation for each graph in the sequence is initialized with the preceding layout…”
BackgroundMethodUsing social media to measure foreign policy dynamics
Zeitzoff, T., Kelly, J., & Lotan, G. (2015) · Journal of Peace Research · doi:10.1177/0022343314558700 · Cited by 65
Local Antecedents and Trigger Events: Policy Implications of Path Dependence for Cluster Formation
Wolfe, D. A., & Gertler, M. S. (2006) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199207183.003.0012 · Cited by 66
Quantile coherency networks of international stock markets
Baumöhl, E., & Shahzad, S. J. H. (2019) · Finance research letters · doi:10.1016/j.frl.2019.04.022 · Cited by 65
Berlim, M. T., Richard‐Devantoy, S., dos Santos, N. R., & Turecki, G. (2020) · Psychological Medicine · doi:10.1017/s0033291720001002 · Cited by 65
A 500-year tale of co-evolution, adaptation, and virulence: Helicobacter pylori in the Americas
Muñoz-Ramírez, Z. Y., Pascoe, B., Méndez-Tenorio, A., Mourkas, E., Sandoval‐Motta, S., Perez-Perez, G., Morgan, D. R., Domínguez, R. L., Ortiz, D., Cavazza, M. E., et al. (2020) · The ISME Journal · doi:10.1038/s41396-020-00758-0 · Cited by 65
Flexible Semantic Network Structure Supports the Production of Creative Metaphor
Li, Y., Kenett, Y. N., Hu, W., & Beaty, R. E. (2021) · Creativity Research Journal · doi:10.1080/10400419.2021.1879508 · Cited by 65
“To visualize the networks (Figure 2), we applied the forcedirected layout (Fruchterman & Reingold, 1991) of the Cytoscape software (Shannon et al., 2003).”
MethodDrawing graphs with non-uniform vertices
Harel, D., & Koren, Y. (2002) · Working Conference on Advanced Visual Interfaces (AVI) · doi:10.1145/1556262.1556288 · Cited by 65
Attraction-Repulsion Spectrum in Neighbor EmbeddingsPreprint
Böhm, J. N., Berens, P., & Kobak, D. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.08902 · Cited by 67
Anatomy of Cluster Development: Emergence and Convergence in the US Human Biotherapeutics, 1976–2003
Romanelli, E., & Feldman, M. P. (2006) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199207183.003.0005 · Cited by 64
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.