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 401–500 of 1,021
Positive associations among rare species and their persistence in ecological assemblages
Calatayud, J., Andivia, E., Escudero, A., Melián, C. J., Bernardo‐Madrid, R., Stoffel, M., Aponte, C., Medina, N. G., Molina‐Venegas, R., Arnán, X., et al. (2019) · Nature Ecology & Evolution · doi:10.1038/s41559-019-1053-5 · Cited by 119
iVisDesigner: Expressive Interactive Design of Information Visualizations
Ren, D., Höllerer, T., & Yuan, X. (2014) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2014.2346291 · Cited by 119
Reevaluating stereo and motion cues for visualizing graphs in three dimensions
Ware, C., & Mitchell, P. (2005) · Symposium on Applied Perception in Graphics and Visualization (APGV) · doi:10.1145/1080402.1080411 · Cited by 119
A multilayer approach to multiplexity and link prediction in online geo-social networks
Hristova, D., Noulas, A., Brown, C., Musolesi, M., & Mascolo, C. (2016) · EPJ Data Science · doi:10.1140/epjds/s13688-016-0087-z · Cited by 118
“We use a Fruchterman Reingold graph layout (Fruchterman and Reingold 1991) to show the core-periphery structure of the network, with larger nodes having a higher global degree k GN .”
MethodRoediger‐Schluga, T., & Barber, M. J. (2008) · International Journal of Foresight and Innovation Policy · doi:10.1504/ijfip.2008.017583 · Cited by 118
Big-Bang Simulation for Embedding Network Distances in Euclidean Space
Shavitt, Y., & Tankel, T. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2004.838597 · Cited by 118
“The heuristics which followed this direction, such as [12], [ 13 ], [14], are reviewed in a recent survey [15].”
MethodCharacterizing social networks and their effects on income diversification in rural Kerala, India
Johny, J., Wichmann, B., & Swallow, B. M. (2017) · World Development · doi:10.1016/j.worlddev.2017.02.002 · Cited by 117
“Refer to Fruchterman and Reingold (1991) for details.”
BackgroundMethodKonaç, D., Young, K. S., Lau, J. Y. F., & Barker, E. D. (2021) · Journal of Psychopathology and Behavioral Assessment · doi:10.1007/s10862-021-09880-5 · Cited by 117
The Free Energy Landscape of Small Molecule Unbinding
Huang, D., & Caflisch, A. (2011) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1002002 · Cited by 116
Topology optimization for heat conduction using generative design algorithms
Lohan, D. J., Dede, E. M., & Allison, J. T. (2016) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-016-1563-6 · Cited by 116
Deconstructing trait anxiety: a network perspective
Heeren, A., Bernstein, E. E., & McNally, R. J. (2018) · Anxiety Stress & Coping · doi:10.1080/10615806.2018.1439263 · Cited by 117
Zhou, Y., Wu, S., Liu, Z., & Rognone, L. (2023) · Nature Communications · doi:10.1038/s41467-023-42925-9 · Cited by 116
“The location of the nodes is decided by the algorithm of Fruchterman and Reingold 46 , which is one ofthemostusedlayoutalgorithms 47 andappliesaniterativeprocessto select the location of the nodes to minimize the energy of the system.”
Industry Induces Academic Science to Know Less about More
Evans, J. A. (2010) · American Journal of Sociology · doi:10.1086/653834 · Cited by 116
A Network Perspective on Attitude Strength: Testing the Connectivity Hypothesis
Dalege, J., Borsboom, D., van Harreveld, F., & van der Maas, H. L. J. (2018) · Social Psychological and Personality Science · doi:10.1177/1948550618781062 · Cited by 115
“Closely connected nodes are placed near each other (Fruchterman & Reingold, 1991).”
BackgroundGeneralizing Question Answering System with Pre-trained Language Model Fine-tuning
Su, D., Xu, Y., Winata, G. I., Xu, P., Kim, H., Liu, Z., & Fung, P. (2019) · Proceedings of the 2nd Workshop on Machine Reading for Question Answering · doi:10.18653/v1/d19-5827 · Cited by 69
Marzio, A., Kurz, E., Sahni, J. M., Di Feo, G., Puccini, J., Jiang, S., Hirsch, C. A., Arbini, A. A., Wu, W. L., Pass, H. I., et al. (2022) · Cell · doi:10.1016/j.cell.2021.12.005 · Cited by 110
Ideological and Temporal Components of Network Polarization in Online Political Participatory Media
Garcia, D., Abisheva, A., Schweighofer, S., Serdült, U., & Schweitzer, F. (2015) · Policy & Internet · doi:10.1002/poi3.82 · Cited by 89
“Following the Fruchterman- Reingold layout algorithm (Fruchterman and Reingold, 1991), which locates connected nodes closer to each other, an initial observation of Figure 2 motivates our research question: politicians seem to be polarized along party lines when creating support links, while this…”
MethodCerebral: Visualizing Multiple Experimental Conditions on a Graph with Biological Context
Barsky, A., Munzner, T., Gardy, J. L., & Kincaid, R. H. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.117 · Cited by 115
“Several attempts have been made to extend force-directed placement to accommodate grouping, for example Fruchterman and Reingold [17] use repulsive walls to contain nodes within an external boundary and Genc and Dogrusoz [18] use mobile internal walls to separate the graph into compartments.”
Background- The Open Graph Drawing Framework (OGDF)
Tamassia, R. (2013) · Chapman & Hall/CRC eBooks · doi:10.1201/b15385-20 · Cited by 115
“The OGDF provides implementations for several classical algorithms, such as the force-directed spring embedder algorithm [6], the grid-variant of Fruchterman and Reingold [10], the simulated annealing approach by Davidson and Harel [4], the algorithm by Kamada and Kawai [20], which uses the shortest graph-theoretic di…”
MethodTEXTQUEST: DOCUMENT CLUSTERING OF MEDLINE ABSTRACTS FOR CONCEPT DISCOVERY IN MOLECULAR BIOLOGY
Iliopoulos, I., Enright, A. J., & Ouzounis, C. (2000) · Pacific Symposium on Biocomputing (PSB) · doi:10.1142/9789814447362_0038 · Cited by 115
“Usually, we obtain terms with a positive θ value, greater than a cut-off threshold value τ. 10. Results are visualized using xlayout (Enright, unpublished), an optimization and graphical display method based on graph drawing by the force-directed placement algorithm [19, 20 ].”
MethodEmergence of core–peripheries in networks
Verma, T., Russmann, F., Araújo, N. A. M., Nagler, J., & Herrmann, H. J. (2016) · Nature Communications · doi:10.1038/ncomms10441 · Cited by 114
“It is immediately evident how the core nodes (in black) are highly interconnected as they are grouped closely together by the force directed Fruchterman–Reingold algorithm 23 .”
R-Syst::diatom: an open-access and curated barcode database for diatoms and freshwater monitoring
Rimet, F., Chaumeil, P., Keck, F., Kermarrec, L., Vasselon, V., Kahlert, M., Franc, A., & Bouchez, A. (2016) · Database · doi:10.1093/database/baw016 · Cited by 114
“The graph is projected onto the plane using the Fruchterman– Reingold layout (41).”
MethodTwo-Way Multidimensional Scaling: A Review
France, S. L., & Carroll, J. D. (2010) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/tsmcc.2010.2078502 · Cited by 115
Hoorelbeke, K., Marchetti, I., Schryver, M. D., & Koster, E. H. W. (2016) · Journal of Affective Disorders · doi:10.1016/j.jad.2016.02.001 · Cited by 114
Progressive Cellular Senescence Mediates Renal Dysfunction in Ischemic Nephropathy
Kim, S. R., Puranik, A. S., Jiang, K., Chen, X., Zhu, X.-Y., Taylor, I., Khodadadi-Jamayran, A., Lerman, A., Hickson, L. J., Childs, B. G., et al. (2021) · Journal of the American Society of Nephrology · doi:10.1681/asn.2020091373 · Cited by 106
GOlorize: a Cytoscape plug-in for network visualization with Gene Ontology-based layout and coloring
Garcia, O., Saveanu, C., Cline, M., Fromont-Racine, M., Jacquier, A., Schwikowski, B., & Aittokallio, T. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btl605 · Cited by 104
Liu, G., Boyd, M., Yu, M., Halim, S. Z., & Quddus, N. (2021) · Process Safety and Environmental Protection · doi:10.1016/j.psep.2021.05.036 · Cited by 112
Holten, D., Isenberg, P., van Wijk, J. J., & Fekete, J. (2011) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2011.5742390 · Cited by 113
“There are many node-link-graph layout models available, the majority of which make use of force-directed node placement algorithms, such as Eades’ spring-embedder model [6], the KamadaKawai model [16], or the Fruchterman-Reingold model [10].”
MethodOn the Visualization of Social and other Scale-Free Networks
Jia, Y., Hoberock, J., Garland, M., & Hart, J. C. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.151 · Cited by 112
“This distribution is ubiquitous, natural and commonly found in the relationships studied in sociology, networking, biology and physics.”
BackgroundBlood‐based metabolic signatures in Alzheimer's disease
de Leeuw, F. A., Peeters, C. F. W., Kester, M. I., Harms, A. C., Struys, E. A., Hankemeier, T., van Vlijmen, H. W. T., van der Lee, S. J., van Duijn, C. M., Scheltens, P., et al. (2017) · Alzheimer's & Dementia: Diagnosis, Assessment & Disease Monitoring · doi:10.1016/j.dadm.2017.07.006 · Cited by 99
Time to #Protest: Selective Exposure, Cascading Activation, and Framing in Social Media
Aruguete, N., & Calvo, E. (2018) · Journal of Communication · doi:10.1093/joc/jqy007 · Cited by 111
Genomic, Network, and Phylogenetic Analysis of the Oomycete Effector Arsenal
McGowan, J., & Fitzpatrick, D. A. (2017) · mSphere · doi:10.1128/msphere.00408-17 · Cited by 111
Network analysis of empathy items from the interpersonal reactivity index in 1973 young adults
Briganti, G., Kempenaers, C., Braun, S., Fried, E. I., & Linkowski, P. (2018) · Psychiatry Research · doi:10.1016/j.psychres.2018.03.082 · Cited by 111
Social media use and well-being: A prospective experience-sampling study
Faelens, L., Hoorelbeke, K., Soenens, B., Van Gaeveren, K., De Marez, L., De Raedt, R., & Koster, E. H. W. (2021) · Computers in Human Behavior · doi:10.1016/j.chb.2020.106510 · Cited by 110
Recognition of crowd behavior from mobile sensors with pattern analysis and graph clustering methods
Roggen, D., W. C. L., Wirz, M., Tröster, G., Helbing, D., & C. E. (2011) · Networks & Heterogeneous Media · doi:10.3934/nhm.2011.6.521 · Cited by 76
Visualizing Group Structures in Graphs: A Survey
Vehlow, C., Beck, F., & Weiskopf, D. (2016) · Computer Graphics Forum · doi:10.1111/cgf.12872 · Cited by 110
Using Complex Network Analysis for Optimization of Water Distribution Networks
Sitzenfrei, R., Wang, Q., Kapelan, Z. S., & Savic, D. A. (2020) · Water Resources Research · doi:10.1029/2020wr027929 · Cited by 110
“Instead of showing the graph in the Euclidean space, a graph drawing by force‐directed placement (Fruchterman & Reingold, 1991) is used, which aims to make edge length uniform and at the same time minimizes edge crossings (Figures 3b and 3c).”
MethodFeasibility and utility of idiographic models in the clinic: A pilot study
Frumkin, M. R., Piccirillo, M. L., Beck, E. D., Grossman, J. T., & Rodebaugh, T. L. (2021) · Psychotherapy Research · doi:10.1080/10503307.2020.1805133 · Cited by 82
“The layout of the idiographic models was based on the FruchtermanReingold algorithm, such that the length of an edge corresponds to its absolute weight (Epskamp et al., 2012; Fruchterman & Reingold, 1991).”
MethodPossible Futures for Network Psychometrics
Borsboom, D. (2022) · Psychometrika · doi:10.1007/s11336-022-09851-z · Cited by 112
“However, as has been documented, aesthetically pleasing representations such as the Fruchterman–Reingold algorithm (Fruchterman & Reingold, 1991) need not always be optimal in representing statistical associations and network structures built on them (Jones et al.,2018).”
InterAxis: Steering Scatterplot Axes via Observation-Level Interaction
Kim, H., Choo, J., Park, H., & Endert, A. (2016) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2015.2467615 · Cited by 96
A social network analysis of student retention using archival data
Eckles, J. E., & Stradley, E. G. (2011) · Social Psychology of Education · doi:10.1007/s11218-011-9173-z · Cited by 111
“Therefore, actors who are hardly connected naturally separate themselves in the drawing, while those who are connected either directly or by way of strong shared connections are drawn together (Fruchterman and Reingold 1991).”
BackgroundMeasuring the robustness of network community structure using assortativity
Shizuka, D., & Farine, D. R. (2016) · Animal Behaviour · doi:10.1016/j.anbehav.2015.12.007 · Cited by 108
“We used the same method to construct and visualize all three networks: edge weight represented the simple ratio association index; there was no edge filtering; and networks were plotted using a force-directed algorithm with weighted edges (Fruchterman & Reingold, 1991).”
MethodChavez‐Baldini, U., Nieman, D. H., Keestra, A., Lok, A., Mocking, R. J. T., de Koning, P. P., Krzhizhanovskaya, V. V., Bockting, C., van Rooijen, G., Smit, D. J. A., et al. (2021) · Psychological Medicine · doi:10.1017/s0033291721001781 · Cited by 112
Trier, M. (2008) · Information Systems Research · doi:10.1287/isre.1080.0191 · Cited by 109
Label Layout for Interactive 3D Illustrations
Ali, K., Hartmann, K., & Strothotte, T. (2005) · Digital Library (University of West Bohemia) · Cited by 109
Social network visualization in epidemiology
Christakis, N. A., & Fowler, J. H. (2009) · Norsk Epidemiologi · doi:10.5324/nje.v19i1.6 · Cited by 108
Automated building layout generation using deep learning and graph algorithms
Wang, L., Liu, J., Yan, Z., Cheng, G., Hu, H., Hu, J., & Huang, X. (2023) · Automation in Construction · doi:10.1016/j.autcon.2023.105036 · Cited by 109
Fault diagnosis of photovoltaic systems using artificial intelligence: A bibliometric approach
Sepúlveda-Oviedo, E. H., Travé-Massuyès, L., Subias, A., Pavlov, M., & Alonso, C. (2023) · Heliyon · doi:10.1016/j.heliyon.2023.e21491 · Cited by 109
“Another technique proposed in [163] aims to achieve uniform edge lengths by modifying the spring embedding model using an analogy with forces in natural systems.”
MethodFacet Graphs: Complex Semantic Querying Made Easy
Heim, P., Ertl, T., & Ziegler, J. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13486-9_20 · Cited by 108
“The nodes in the graph are positioned in an aesthetically pleasing way by performing a force-directed layout algorithm [14].”
MethodNew product adoption in social networks: Why direction matters
Hinz, O. F., Schulze, C., & Takac, C. (2012) · Journal of Business Research · doi:10.1016/j.jbusres.2012.07.005 · Cited by 108
Toward a Network Theory of Alliance Formation
Cranmer, S., Desmarais, B. A., & Kirkland, J. H. (2012) · International Interactions · doi:10.1080/03050629.2012.677741 · Cited by 108
Weighted Stochastic Block Models of the Human Connectome across the Life Span
Faskowitz, J., Yan, X., Zuo, X., & Sporns, O. (2018) · Scientific Reports · doi:10.1038/s41598-018-31202-1 · Cited by 108
Visualization of protein interaction networks: problems and solutions
Agapito, G., Guzzi, P. H., & Cannataro, M. (2013) · BMC Bioinformatics · doi:10.1186/1471-2105-14-s1-s1 · Cited by 107
Liang, S., Liu, C., Rotaru, K., Li, K., Wei, X., Yuan, S., Yang, Q., Ren, L., & Liu, X. (2022) · Psychiatry Research · doi:10.1016/j.psychres.2022.114863 · Cited by 95
“The layout of the presented networks was based on the FruchtermanReingold algorithm (Fruchterman and Reingold, 1991).”
Methodsna: Tools for Social Network Analysis
Butts, C. T. (2001) · doi:10.32614/cran.package.sna · Cited by 107
Network Structure Explains the Impact of Attitudes on Voting Decisions
Dalege, J., Borsboom, D., van Harreveld, F., Waldorp, L., & van der Maas, H. L. J. (2017) · Scientific Reports · doi:10.1038/s41598-017-05048-y · Cited by 106
An experimental comparison of force-directed and randomized graph drawing algorithms
Brandenburg, F. J., Himsolt, M., & Rohrer, C. (1996) · Lecture notes in computer science · doi:10.1007/bfb0021792 · Cited by 106
“Related experimental work on graph drawing has been presented by Davidson and Harel [1] and Fruchterman and Reingold [5], which mutually compare their drawings, by Frick et al.”
MethodInfluentialMentzen, W. I., Peng, J., Ransom, N., Nikolau, B. J., & Wurtele, E. S. (2008) · BMC Plant Biology · doi:10.1186/1471-2229-8-76 · Cited by 106
“Using Pearson correlation thresholds of 0.5, 0.6 and 0.7 yields three co-expression networks of 107, 77 and 62 genes, connected by 733, 444, and 204 edges, respectively (Fig. 2). The positioning of the nodes (genes) in these networks was produced by graph-layout software that places highly interconnected nodes close t…”
MethodInfluentialVisualizing Asymmetric Competition Among More Than 1,000 Products Using Big Search Data
Ringel, D. M., & Skiera, B. (2016) · Marketing Science · doi:10.1287/mksc.2015.0950 · Cited by 88
Combined Inhibition of SHP2 and CXCR1/2 Promotes Antitumor T-cell Response in NSCLC
Tang, K. H., Li, S., Khodadadi-Jamayran, A., Jen, J., Han, H., Guidry, K., Chen, T., Hao, Y., Fedele, C., Zebala, J. A., et al. (2022) · Cancer Discovery · doi:10.1158/2159-8290.cd-21-0369 · Cited by 105
Interactive Exploration of Implicit and Explicit Relations in Faceted Datasets
Zhao, J., Collins, C. M., Chevalier, F., & Balakrishnan, R. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.167 · Cited by 105
“, the explicit relations) is presented by combining the visualizations in every Query Cell with: 1) either default node-link views by applying a force-directed layout algorithm [16] or 2) matrix-style views with nodes aligned diagonally (Figure 4).”
BackgroundMethodVisualization and cellular hierarchy inference of single-cell data using SPADE
Anchang, B., Hart, T. D. P., Bendall, S. C., Qiu, P., Bjornson, Z. B., Linderman, M. D., Nolan, G. P., & Plevritis, S. K. (2016) · Nature Protocols · doi:10.1038/nprot.2016.066 · Cited by 105
Beck, D., Ferasso, M., Storópoli, J., & Vigoda‐Gadot, E. (2023) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2023.136501 · Cited by 105
Paradowski, M. B., & Jelińska, M. (2023) · Computer Assisted Language Learning · doi:10.1080/09588221.2023.2192762 · Cited by 105
“In the Fruchterman-Reingold (FR) algorithm, the closer the distance between the nodes, the stronger the relationship between them (Fruchterman & Reingold, 1991).”
Ouvrard, D., Chalise, P., & Percy, D. M. (2015) · Systematics and Biodiversity · doi:10.1080/14772000.2015.1046969 · Cited by 105
Verstraelen, T., Speybroeck, V. V., & Waroquier, M. (2009) · The Journal of Chemical Physics · doi:10.1063/1.3187034 · Cited by 105
A Multilevel Approach to the Travelling Salesman Problem
Walshaw, C. H. (2002) · Operations Research · doi:10.1287/opre.50.5.862.373 · Cited by 105
“We have implemented this strategy with a simple data structure similar to that used previously by Bonomi & Lutton, [6], for excluding long distance edges from random perturbations in a simulated annealing TSP implementation and by Fruchterman & Reingold, [11], for graph drawing.”
MethodVisual exploration of complex time-varying graphs
Kumar, G., & Garland, M. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.193 · Cited by 105
“Kamada and Kawai [16] modeled a graph as a complete system of linear springs, and Fruchterman and Reingold [ 10 ] refined and simplified their force calculations.”
BackgroundMethodThe network structure of psychopathology in a community sample of preadolescents.
Boschloo, L., Schoevers, R. A., van Borkulo, C. D., Borsboom, D., & Oldehinkel, A. J. (2016) · Journal of Abnormal Psychology · doi:10.1037/abn0000150 · Cited by 97
“The layout of the graph is based on the Fruchterman-Reingold algorithm, which iteratively computes the optimal layout so that YSR items with stronger or more connections are placed closer to each other (Fruchterman & Reingold, 1991).”
Graph Drawing by High-Dimensional Embedding
Harel, D., & Koren, Y. (2006) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812773289_0012 · Cited by 105
Information Dynamics in the Networked World
Huberman, B. A., & Adamic, L. A. (2004) · Lecture notes in physics · doi:10.1007/978-3-540-44485-5_17 · Cited by 105
Design and Analysis of the NIPS 2016 Review Process
Shah, N. B., Tabibian, B., Muandet, K., Guyon, I., & Ulrike Von Luxburg, A. (2017) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.48550/arxiv.1708.09794 · Cited by 46
“In Figure 17, we plot the graph of reviewers and papers using the Fruchterman-Reingold algorithm (Fruchterman and Reingold, 1991).”
MethodReexamining trait rumination as a system of repetitive negative thoughts: A network analysis
Bernstein, E. E., Heeren, A., & McNally, R. J. (2019) · Journal of Behavior Therapy and Experimental Psychiatry · doi:10.1016/j.jbtep.2018.12.005 · Cited by 96
Review of Cooperative Game Theory applications in power system expansion planning
Churkin, A., Bialek, J. W., Pozo, D., Sauma, E. E., & Коргин, Н. А. (2021) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2021.111056 · Cited by 104
A Maxent-Stress Model for Graph Layout
Gansner, E. R., Hu, Y., & North, S. C. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.299 · Cited by 104
“On coarse levels, a Kamada-Kawai algorithm [25] is applied to each node within a local neighborhood of the original graph, but on the finest level, a localized Fruchterman-Reingold algorithm is used [13].”
BackgroundMethodNetworks Depicting the Fine-Scale Co-Occurrences of Fungi in Soil Horizons
Toju, H., Kishida, O., Katayama, N., & Takagi, K. (2016) · PLoS ONE · doi:10.1371/journal.pone.0165987 · Cited by 104
Transdiagnostic vulnerability factors in eating disorders: A network analysis
Vervaet, M., Puttevils, L., Hoekstra, R. H. A., Fried, E., & Vanderhasselt, M. (2021) · European Eating Disorders Review · doi:10.1002/erv.2805 · Cited by 87
Amplifying influence through coordinated behaviour in social networks
Weber, D., & Neumann, F. (2021) · Social Network Analysis and Mining · doi:10.1007/s13278-021-00815-2 · Cited by 71
Network models of posttraumatic stress disorder: A meta-analysis.
Isvoranu, A., Epskamp, S., & Cheung, M. W. ‐. (2021) · Journal of Abnormal Psychology · doi:10.1037/abn0000704 · Cited by 103
The covariance environment defines cellular niches for spatial inference
Haviv, D., Remšík, J., Gatie, M. I., Snopkowski, C., Takizawa, M., Pereira, N., Bashkin, J., Jovanovich, S. B., Nawy, T., Chaligné, R., et al. (2024) · Nature Biotechnology · doi:10.1038/s41587-024-02193-4 · Cited by 104
A multi-scale algorithm for drawing graphs nicely
Hadany, R., & Harel, D. (2001) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(00)00389-9 · Cited by 103
Prevalence and co‐existence of active components of ‘legal highs’
Zuba, D., & Byrska, B. (2012) · Drug Testing and Analysis · doi:10.1002/dta.1365 · Cited by 103
On-line Animated Visualization of Huge Graphs using a Modified Spring Algorithm
Huang, M. L., Eades, P., & Wang, J. (1998) · Journal of Visual Languages & Computing · doi:10.1006/jvlc.1998.0094 · Cited by 103
Goffe, A. S., Zinner, D. P., & Fischer, J. (2016) · Behavioral Ecology and Sociobiology · doi:10.1007/s00265-015-2050-6 · Cited by 102
“Reingold layout (Fruchterman and Reingold 1991), and the calculation of network metrics was performed in R using”
MethodUntangling direct species associations from indirect mediator species effects with graphical models
Popovic, G. C., Warton, D. I., Thomson, F. J., Hui, F. K. C., & Moles, A. T. (2019) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.13247 · Cited by 102
“We employ the Fruchterman Reingold algorithm (Fruchterman & Reingold, 1991) to position nodes on the graphs in two dimensions.”
MethodA multi-dimensional approach to force-directed layouts of large graphs
Gajer, P., Goodrich, M. T., & Kobourov, S. (2004) · Computational Geometry · doi:10.1016/j.comgeo.2004.03.014 · Cited by 102
“Examples of force-directed algorithm include the algorithms of Kamada and Kawai [18], Davidson and Harel [4], Fruchterman and Reingold [ 13 ], and Frick et al [3,12].”
MethodDeserno, M. K., Borsboom, D., Begeer, S., & Geurts, H. M. (2017) · Autism · doi:10.1177/1362361316660309 · Cited by 89
“In the visualizations used here, nodes that have many strong associations are positioned near the center of the network, while nodes with weaker correlations are positioned in the periphery of the network (Fruchterman and Reingold, 1991).”
MethodOn the relationship between the structural and socioacademic communities of a coauthorship network
Rodriguez, M. A., & Pepe, A. (2008) · Journal of Informetrics · doi:10.1016/j.joi.2008.04.002 · Cited by 102
“The structural communities found in the coauthorship network via the leading eigenvector algorithm are diagrammed in Figure 1 according to the Fruchterman-Reingold network layout algorithm (Fruchterman & Reingold, 1991).”
MethodSmith, K. E., Mason, T. B., Crosby, R. D., Cao, L., Leonard, R. C., Wetterneck, C. T., Smith, B. E. R., Farrell, N. R., Riemann, B. C., Wonderlich, S. A., et al. (2019) · Psychological Medicine · doi:10.1017/s0033291718000867 · Cited by 101
A survey on clinical natural language processing in the United Kingdom from 2007 to 2022
Wu, H., Wang, M., Wu, J., Francis, F., Chang, Y.-H., Shavick, A., Dong, H., Poon, M. T. C., Fitzpatrick, N., Levine, A. P., et al. (2022) · npj Digital Medicine · doi:10.1038/s41746-022-00730-6 · Cited by 101
Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies
Zbinden, S., Bärtschi, A., Djidjev, H., & Eidenbenz, S. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-50743-5_10 · Cited by 56
“Fruchterman-Reingold [16] is a force-directed graph drawing algorithm that computes a plane layout based on two principles: nodes pairwise repel each other, but nodes connected by an edge at the same time attract each other.”
BackgroundThe Visual Causality Analyst: An Interactive Interface for Causal Reasoning
Wang, J., & Mueller, K. D. (2015) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2015.2467931 · Cited by 101
Connectivity-based localization of large-scale sensor networks with complex shape
Lederer, S., Wang, Y., & Gao, J. (2009) · ACM Transactions on Sensor Networks · doi:10.1145/1614379.1614383 · Cited by 101
Bull, P. C., Buckee, C. O., Kyes, S., Kortok, M., Thathy, V., Guyah, B., Stoute, J. A., Newbold, C., & Marsh, K. (2008) · Molecular Microbiology · doi:10.1111/j.1365-2958.2008.06248.x · Cited by 101
“3D networks were drawn using the Fruchterman Reingold algorithm (Fruchterman and Reingold, 1991) within Pajek.”
Castro, M. A. A., Wang, X., Fletcher, M. N. C., Meyer, K. B., & Markowetz, F. M. (2012) · Genome biology · doi:10.1186/gb-2012-13-4-r29 · Cited by 101
Hoorelbeke, K., Van den Bergh, N., Wichers, M., & Koster, E. H. W. (2019) · Behaviour Research and Therapy · doi:10.1016/j.brat.2019.01.007 · Cited by 91
“Based on patterns of connectivity, nodes obtain a specific position in the model reflecting the centrality of a given node within a network (e.g., using the Fruchterman and Reingold’s algorithm; Fruchterman & Reingold, 1991).”
Terada, Y., & Ulrike Von Luxburg, A. (2014) · International Conference on Machine Learning · Cited by 100
Dynamic exploration and editing of KEGG pathway diagrams
Klukas, C., & Schreiber, F. (2006) · Bioinformatics · doi:10.1093/bioinformatics/btl611 · Cited by 100
“The layout of the overview graph G0 can be given by an user or produced by layout algorithms such as force-directed (Eades, 1984; Fruchterman and Reingold, 1991 ) or hierarchical layout methods (Sugiyama et al., 1981).”
MethodInfluentialWhat are Makerspaces, Hackerspaces, and Fab Labs?Preprint
van Holm, E. J. (2015) · SSRN Electronic Journal · doi:10.2139/ssrn.2548211 · Cited by 100
Gradient Estimation with Stochastic Softmax TricksPreprint
Paulus, M. B., Choi, D., Tarlow, D., Krause, A., & Maddison, C. J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.08063 · Cited by 100
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.