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 201–300 of 1,021
Molecular architecture of the chick vestibular hair bundle
Shin, J.-B., Krey, J. F., Hassan, A., Metlagel, Z., Tauscher, A. N., Pagana, J. M., Sherman, N. E., Jeffery, E. D., Spinelli, K. J., Zhao, H., et al. (2013) · Nature Neuroscience · doi:10.1038/nn.3312 · Cited by 206
Networks of Depression and Anxiety Symptoms Across Development
McElroy, E., Fearon, P., Belsky, J., Fonagy, P., & Patalay, P. (2018) · Journal of the American Academy of Child & Adolescent Psychiatry · doi:10.1016/j.jaac.2018.05.027 · Cited by 205
“Networks were constructed using the 18 symptom nodes at each time point, and were graphically illustrated using the “qgraph” package,(31) which implements the Fruchterman–Reingold algorithm to place highly connected nodes closer together.(32) The reliability and accuracy of the estimated networks (ie, the degree of co…”
MethodAfzali, M. H., Sunderland, M., Teesson, M., Carragher, N., Mills, K., & Slade, T. (2017) · Journal of Affective Disorders · doi:10.1016/j.jad.2016.10.037 · Cited by 205
MultiQA: An Empirical Investigation of Generalization and Transfer in Reading Comprehension
Talmor, A., & Berant, J. (2019) · Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics · doi:10.18653/v1/p19-1485 · Cited by 152
Air pollution could drive global dissemination of antibiotic resistance genes
Zhu, G., Wang, X., Yang, T., Su, J., Qin, Y., Wang, S., Gillings, M., Wang, C., Ju, F., Lan, B., et al. (2021) · The ISME Journal · doi:10.1038/s41396-020-00780-2 · Cited by 204
Verdier, J., Lalanne, D., Pelletier, S., Torres-Jerez, I., Righetti, K., Bandyopadhyay, K., Leprince, O., Chatelain, E., Vu, B. L., Gouzy, J., et al. (2013) · PLANT PHYSIOLOGY · doi:10.1104/pp.113.222380 · Cited by 202
“Using the gene coexpression network analysis module of ArrayMining (Glaab et al., 2009), a simple topological network analysis was applied to construct a weighted gene coexpression network using the graph-layout algorithm by Fruchterman and Reingold (1991).”
MethodAn experimental comparison of four graph drawing algorithms
Battista, G. D., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., & Vargiu, F. (1997) · Computational Geometry · doi:10.1016/s0925-7721(96)00005-3 · Cited by 202
“Himsolt [20] presents a comparative study of twelve graph drawings algorithms, including [8, 12, 17, 28, 38, 39, 48, 50].”
BackgroundHigh-density multi-fiber photometry for studying large-scale brain circuit dynamics
Sych, Y., Chernysheva, M., Sumanovski, L. T., & Helmchen, F. (2019) · Nature Methods · doi:10.1038/s41592-019-0400-4 · Cited by 201
Haggarty, S. J., Koeller, K. M., Wong, J. C., Butcher, R. A., & Schreiber, S. L. (2003) · Chemistry & Biology · doi:10.1016/s1074-5521(03)00095-4 · Cited by 201
Exploration of biological network centralities with CentiBiN
Junker, B. H., Koschützki, D., & Schreiber, F. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-219 · Cited by 199
Introdução à análise de redes sociais online
Recuero, R. (2017) · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · Cited by 198
Chen, L., & Buja, A. (2009) · Journal of the American Statistical Association · doi:10.1198/jasa.2009.0111 · Cited by 197
Alexander-Bloch, A., Lambiotte, R., Roberts, B., Giedd, J., Gogtay, N., & Bullmore, E. (2012) · NeuroImage · doi:10.1016/j.neuroimage.2011.11.035 · Cited by 196
“pological space using a forced-based algorithm (Fruchterman and Reingold, 1991), for two”
Dunne, C., & Shneiderman, B. (2013) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/2470654.2466444 · Cited by 195
Smith, E. B. (2011) · Administrative Science Quarterly · doi:10.2189/asqu.2011.56.1.061 · Cited by 195
Frishman, Y., & Tal, A. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.11 · Cited by 194
Network structure of depression and anxiety symptoms in Chinese female nursing students
Ren, L., Wang, Y., Wu, L., Wei, Z., Cui, L., Wei, X., Hu, X., Peng, J., Jin, Y., Li, F., et al. (2021) · BMC Psychiatry · doi:10.1186/s12888-021-03276-1 · Cited by 194
“tions appear near the center of the network, while nodes with weak and a small number of connections walk around the periphery of the network [43].”
BackgroundConstruction and analysis of protein–protein interaction networks
Raman, K. (2010) · Automated Experimentation · doi:10.1186/1759-4499-2-2 · Cited by 193
Community Detection for Correlation Matrices
MacMahon, M., & Garlaschelli, D. (2015) · Physical Review X · doi:10.1103/physrevx.5.021006 · Cited by 134
“5, was visualized using a clustered rendering [57] of all the stocks that do not end up completely isolated after the filtration, according to the FruchtermanReingold [58] force-based algorithm.”
MethodOn the evolution of mobile platform ecosystem structure and strategy
Basole, R. C., & Karla, J. (2011) · Business & Information Systems Engineering · doi:10.1007/s12599-011-0174-4 · Cited by 192
“For the purpose of this study, we used a combination of the Kamada-Kawai (KK) algorithm (Kamada and Kawai 1989) and Fruchterman-Reingold (FR) algorithm (Fruchterman and Reingold 1991).”
MethodSTUDYING SUPPLY CHAINS FROM A SOCIAL NETWORK PERSPECTIVE
GALASKIEWICZ, J. (2011) · Journal of Supply Chain Management · doi:10.1111/j.1745-493x.2010.03209.x · Cited by 192
Food sharing, redistribution, and waste reduction via mobile applications: A social network analysis
Harvey, J., Smith, A., Goulding, J., & Branco Illodo, I. (2020) · Industrial Marketing Management · doi:10.1016/j.indmarman.2019.02.019 · Cited by 192
Physician Patient-sharing Networks and the Cost and Intensity of Care in US Hospitals
Barnett, M. L., Christakis, N. A., O’Malley, J., Onnela, J.-P., Keating, N. L., & Landon, B. E. (2012) · Medical Care · doi:10.1097/mlr.0b013e31822dcef7 · Cited by 192
“Visually, doctors with high betweenness centrality lie in the middle, rather than on the periphery, of a network map visualized with standard algorithms.(33) Physicians with higher betweenness centrality are well positioned in their network to have greater access to, and influence on, the flow of information among doc…”
BackgroundMethodA survey of surveys on the use of visualization for interpreting machine learning models
Chatzimparmpas, A., Martins, R. M., Jusufi, I., & Kerren, A. (2020) · Information Visualization · doi:10.1177/1473871620904671 · Cited by 150
Gomez, A., Petrzelkova, K., Yeoman, C. J., Vlckova, K., Mrázek, J., Koppova, I., Carbonero, F., Ulanov, A., Modry, D., Todd, A., et al. (2015) · Molecular Ecology · doi:10.1111/mec.13181 · Cited by 190
“…correlated taxa and metabolites (r > 0.5, Adjusted FDR-q 0.05) was used to construct a network analysis based on the Fruchterman–Rheingold layout (Fruchterman & Reingold 1991), a force-directed algorithm in which nodes have stronger repulsive force from distant nodes and hence allows for…”
MethodInfluentialInternational Trade and Institutional Change: Medieval Venice’s Response to Globalization*
Puga, D., & Trefler, D. (2014) · The Quarterly Journal of Economics · doi:10.1093/qje/qju006 · Cited by 190
Spiegel, O., Abbassi, P., Zylka, M. P., Schlagwein, D., Fischbach, K., & Schoder, D. (2015) · Information Systems Journal · doi:10.1111/isj.12073 · Cited by 195
Plasmodium malariae and P. ovale genomes provide insights into malaria parasite evolution
Rutledge, G. G., Böhme, U., Sanders, M., Reid, A. J., Cotton, J. A., Maiga-Ascofare, O., Djimdé, A. A., Apinjoh, T. O., Amenga-Etego, L., Manske, M., et al. (2017) · Nature · doi:10.1038/nature21038 · Cited by 188
Signal Processing on Graphs: Causal Modeling of Un structured Data
Mei, J., & Moura, J. M. F. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2634543 · Cited by 187
“…edge weights (absolute values) for K-Regular (top left), Stochastic Block-Model (top right) Erdös-Renyi (bottom left), and Power Law (bottom right) graphs for N=1000 bundling [36] to group nearby edges into few thicker “strands” in addition to circular layouts; and for PL, see figure 3(d)…”
BackgroundDi, X., Gohel, S., Kim, E. H., & Biswal, B. B. (2013) · Frontiers in Human Neuroscience · doi:10.3389/fnhum.2013.00493 · Cited by 186
“The two networks and their modular structures were rendered into a 2D surface using the Fruchterman–Reingold Algorithm (Fruchterman and Reingold, 1991).”
MethodVisualizing graphs in three dimensions
Ware, C., & Mitchell, P. (2008) · ACM Transactions on Applied Perception · doi:10.1145/1279640.1279642 · Cited by 186
The semantic mapping of words and co-words in contexts
Leydesdorff, L., & Welbers, K. (2011) · Journal of Informetrics · doi:10.1016/j.joi.2011.01.008 · Cited by 188
“(Fruchterman & Reingold, 1991).”
Empirical Evaluation of Aesthetics-based Graph Layout
Purchase, H. C., Carrington, D., & Allder, J.-A. (2002) · Empirical Software Engineering · doi:10.1023/a:1016344215610 · Cited by 185
“FD-FR: This force directed algorithm by Fruchterman and Reingold (1991) is based on an original idea by Eades (1984).”
MethodRelFinder: Revealing Relationships in RDF Knowledge Bases
Heim, P., Hellmann, S., Lehmann, J., Lohmann, S., & Stegemann, T. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-10543-2_21 · Cited by 185
“Since the labels of the edges are crucial for understanding the relationships they serve as flexible articulations in the force-directed layout [3], what reduces overlaps but cannot completely avoid them.”
BackgroundFADE: Graph Drawing, Clustering, and Visual Abstraction
Quigley, A. J., & Eades, P. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44541-2_19 · Cited by 185
“Numerous graph drawing systems have been developed based on such force directed algorithms [9,36, 8 ,5].”
BackgroundMethodInfluentialAn Exploration of Enterprise Architecture Research
Simon, D., Fischbach, K., & Schoder, D. (2013) · Communications of the Association for Information Systems · doi:10.17705/1cais.03201 · Cited by 184
A Multilevel Algorithm for Force-Directed Graph Drawing
Walshaw, C. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44541-2_17 · Cited by 184
“For example, Fruchterman & Reingold, [8], suggest the possible use of 'a multigrid technique that allows whole portions of the graph to be moved' whilst Davidson & Harel, [3], suggest a multilevel approach to 'expedite the SA [simulated annealing] process'.”
Ghaemi, M. S., DiGiulio, D. B., Contrepois, K., Callahan, B., Ngo, T. T. M., Lee-McMullen, B., Lehallier, B., Robaczewska, A., Mcilwain, D., Rosenberg-Hasson, Y., et al. (2019) · Bioinformatics · doi:10.1093/bioinformatics/bty537 · Cited by 184
“To enable biological exploration, the top hits from each model were extracted using a bootstrapping strategy for sensitivity analysis (see Section 2 for details) and visualized using a minimum spanning tree of Spearman correlations between the selected features on a Fruchterman-Reingold layout (Fruchterman and Reingol…”
MethodTopicNets: Visual Analysis of Large Text Corpora with Topic Modeling
Gretarsson, B., O’Donovan, J., Bostandjiev, S., Höllerer, T., Asuncion, A., Newman, D. J., & Smyth, P. (2012) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2089094.2089099 · Cited by 184
“Topic nodes are then fixed into position and a standard force-directed layout algorithm[Eades 1984; Fruchterman and Reingold 1991; Lauther 2006] is applied to place the document nodes in this topic space.”
MethodInfluentialOshima, J., Oshima, R., & Matsuzawa, Y. (2012) · Educational Technology Research and Development · doi:10.1007/s11423-012-9265-2 · Cited by 182
“For the network of selected words, a layout described by Fruchterman and Reingold (1991) is used in order to illustrate the links between words.”
MethodGraphDiaries: Animated Transitions andTemporal Navigation for Dynamic Networks
Bach, B., Pietriga, E., & Fekete, J.-D. (2014) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.254 · Cited by 182
“algorithm [44] on each time-step independently.”
Ersche, K. D., Lim, T.-V., Ward, L. H. E., Robbins, T. W., & Stochl, J. (2017) · Personality and Individual Differences · doi:10.1016/j.paid.2017.04.024 · Cited by 181
The Intellectual Structure Of Research Into PPPs: A bibliometric analysis
Marsilio, M., Cappellaro, G., & Cuccurullo, C. (2011) · Public Management Review · doi:10.1080/14719037.2010.539112 · Cited by 182
“A threshold of five cocitations was used to enhance map significance and the Fruchterman-Reingold network algorithm was applied in order to minimize system stress in the network8 (Fruchterman and Reingold 1991).”
MethodTopoLayout: Multilevel Graph Layout by Topological Features
Archambault, D., Munzner, T., & Auber, D. (2007) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.46 · Cited by 180
Stochastic Epidemic Models with Inference
Britton, T., & Pardoux, É. (2019) · Lecture notes in mathematics · doi:10.1007/978-3-030-30900-8 · Cited by 180
An Energy Model for Visual Graph Clustering
Noack, A. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24595-7_40 · Cited by 180
The structure and evolution of business-to-business marketing: A citation and co-citation analysis
Backhaus, K., Lügger, K., & Koch, M. (2011) · Industrial Marketing Management · doi:10.1016/j.indmarman.2011.06.024 · Cited by 179
Beck, D., & Ferasso, M. (2022) · Ecological Economics · doi:10.1016/j.ecolecon.2022.107673 · Cited by 179
A survey of two-dimensional graph layout techniques for information visualisation
Gibson, H., Faith, J., & Vickers, P. (2013) · Information Visualization · doi:10.1177/1473871612455749 · Cited by 178
“The first adaptation, which was for speed and simplicity, of the spring-embedder algorithm was by Fruchterman and Reingold.(26) This was subject to the properties of connected nodes appearing close to one another (but not too close), aiming for a layout which conformed to the principles of even node distribution, few…”
MethodHeeren, A., Jones, P. J., & McNally, R. J. (2018) · Journal of Affective Disorders · doi:10.1016/j.jad.2017.12.003 · Cited by 176
Compromised Gut Microbiota Networks in Children With Anti-Islet Cell Autoimmunity
Endesfelder, D., zu Castell, W., Ardissone, A., Davis-Richardson, A. G., Achenbach, P., Hagen, M., Pflueger, M., Gano, K. A., Fagen, J. R., Drew, J. C., et al. (2014) · Diabetes · doi:10.2337/db13-1676 · Cited by 175
Classification of AAA+ proteins
Ammelburg, M., Frickey, T., & Lupas, A. N. (2006) · Journal of Structural Biology · doi:10.1016/j.jsb.2006.05.002 · Cited by 175
A bibliometric review: Energy consumption and greenhouse gas emissions in the residential sector
Geng, Y., Chen, W., Liu, Z., Chiu, A. S. F., Han, W., Liu, Z., Zhong, S., Qian, Y., You, W., & Cui, X. (2017) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2017.05.091 · Cited by 174
Equity in Public Services: A Systematic Literature Review
Cepiku, D., & Mastrodascio, M. (2021) · Public Administration Review · doi:10.1111/puar.13402 · Cited by 173
Grayson, D. S., Bliss-Moreau, E., Machado, C. J., Bennett, J., Shen, K., Grant, K. A., Fair, D. A., & Amaral, D. G. (2016) · Neuron · doi:10.1016/j.neuron.2016.06.005 · Cited by 172
OmicsNet: a web-based tool for creation and visual analysis of biological networks in 3D space
Zhou, G., & Xia, J. (2018) · Nucleic Acids Research · doi:10.1093/nar/gky510 · Cited by 172
“This algorithm was adapted from the standard 2D force-directed layout algorithm (37).”
MethodHeeren, A., & McNally, R. J. (2016) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2016.06.009 · Cited by 170
Network Analysis of World Trade using the BACI-CEPII Dataset
De Benedictis, L., Nenci, S., Santoni, G., Tajoli, L., & Vicarelli, C. (2014) · Global Economy Journal · doi:10.1515/gej-2014-0032 · Cited by 170
“BACI uses a mirror statistic strategy to impute missing data (see Gaulier and Zignago (2010) for a description of the data, the methodology used, and the comparison with other databases).”
The emergent network structure of the multilateral environmental agreement system
Kim, R. E. (2013) · Global Environmental Change · doi:10.1016/j.gloenvcha.2013.07.006 · Cited by 170
Interactive Visualization of Small World Graphs
van Ham, F., & van Wijk, J. J. (2005) · IEEE Symposium on Information Visualization · doi:10.1109/infvis.2004.43 · Cited by 170
“Note that 3-PolyLog has an energy function that is equal to the one used by [11].”
MethodA Fast Multi-Scale Method for Drawing Large Graphs
Harel, D., & Koren, Y. (2002) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00051 · Cited by 169
Interactive overlays: A new method for generating global journal maps from Web-of-Science data
Leydesdorff, L., & Rafols, I. (2012) · Journal of Informetrics · doi:10.1016/j.joi.2011.11.003 · Cited by 169
Amador, J. L. M., & Cabral, S. (2016) · World Economy · doi:10.1111/twec.12469 · Cited by 169
“8Other layout algorithms were tried, like the Fruchterman-Reingold force-directed algorithm (Fruchterman and Reingold, 1991), without substantial differences in the visualisation of the networks.”
Goad, D. M., Zhu, C., & Kellogg, E. A. (2016) · New Phytologist · doi:10.1111/nph.14348 · Cited by 169
RAE-eletrônica: exploração do acervo à luz da bibliometria, geoanálise e redes sociais
Francisco, E. D. R. (2011) · Revista de Administração de Empresas · doi:10.1590/s0034-75902011000300008 · Cited by 168
Smart Monitoring and Controlling of Government Policies Using Social Media and Cloud Computing
Singh, P., Dwivedi, Y. K., Kahlon, K. S., Sawhney, R. S., Alalwan, A. A., & Rana, N. P. (2019) · Information Systems Frontiers · doi:10.1007/s10796-019-09916-y · Cited by 167
“The association is plotted using Fruchterman-Reingold layout (Fruchterman and Reingold 1991; Csardi and Nepusz 2006).”
BioLayout—an automatic graph layout algorithm for similarity visualization
Enright, A. J., & Ouzounis, C. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.9.853 · Cited by 168
Intercity Relations and Globalisation: The Evolution of the Global Urban Hierarchy, 1981—2007
Alderson, A. S., Beckfield, J., & Sprague-Jones, J. (2010) · Urban Studies · doi:10.1177/0042098010372679 · Cited by 167
“While they differ in the particulars, all such algorithms attempt to find a solution that minimises the energy of the system (Eades, 1984; Fruchterman and Reingold, 1991).”
BackgroundCorrelation and network analysis of global financial indices
Kumar, S., & Deo, N. (2012) · Physical Review E · doi:10.1103/physreve.86.026101 · Cited by 167
Kossakowski, J. J., Epskamp, S., Kieffer, J. M., van Borkulo, C. D., Rhemtulla, M., & Borsboom, D. (2016) · Quality of Life Research · doi:10.1007/s11136-015-1127-z · Cited by 145
“The Fruchterman–Reingold algorithm, which places more strongly connected nodes closer together, is used for node placement in all networks [40].”
Kinase selectivity potential for inhibitors targeting the ATP binding site: a network analysis
Danzhi Huang, A., Zhou, T., Lafleur, K., Nevado, C., & Caflisch, A. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp650 · Cited by 167
Impact of the COVID-19 outbreak on the US equity sectors: Evidence from quantile return spillovers
Shahzad, S. J. H., Bouri, E. I., Krištoufek, L., & Saeed, T. (2021) · Financial Innovation · doi:10.1186/s40854-021-00228-2 · Cited by 167
“The layout of the nodes is determined by applying the force-directed algorithm of Fruchterman and Reingold (1991) Baseline network connectedness at the conditional mean and median As a baseline case of the system topology, we inspect the network properties and connectedness at the conditional mean…”
MethodTo Embed or Not: Network Embedding as a Paradigm in Computational Biology
Nelson, W., Zitnik, M., Wang, B., Leskovec, J., Goldenberg, A., & Sharan, R. (2019) · Frontiers in Genetics · doi:10.3389/fgene.2019.00381 · Cited by 166
“Initially proposed in (Eades, 1984) as an extension of (Tutte, 1963), and further developed in (Fruchterman and Reingold, 1991), the spring-embedder model is a particularly elegant example: one can imagine that connected pairs of nodes are attached to springs which bring them closer together, while…”
BackgroundUnsupervised User Stance Detection on Twitter
Darwish, K., Stefanov, P., Aupetit, M., & Nakov, P. (2020) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v14i1.7286 · Cited by 165
Reopening Openness to Experience: A Network Analysis of Four Openness to Experience Inventories
Christensen, A. P., Cotter, K. N., & Silvia, P. J. (2019) · Journal of Personality Assessment · doi:10.1080/00223891.2018.1467428 · Cited by 165
Network Analysis of the Multidimensional Symptom Experience of Oncology
Papachristou, N., Barnaghi, P., Cooper, B., Kober, K. M., Maguire, R., Paul, S. M., Hammer, M., Wright, F., Armes, J., Furlong, E. P., et al. (2019) · Scientific Reports · doi:10.1038/s41598-018-36973-1 · Cited by 165
Deshpande, G., Santhanam, P., & Hu, X. (2011) · NeuroImage · doi:10.1016/j.neuroimage.2010.09.024 · Cited by 165
“With this approach, first introduced by Fruchterman and Reingold (Fruchterman & Reingold, 1991), we considered the ROI time series as the data sources and their instantaneous correlation as the similarity information driving the attractive and repulsive forces.”
GraphAEL: Graph Animations with Evolving Layouts
Erten, C., Harding, P. J., Kobourov, S., Wampler, K., & Yee, G. V. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24595-7_9 · Cited by 165
“The Fruchterman-Reingold method [10] for calculating the displacement of a vertex v, F FR(v) = F a,FR +F r,FR, is used at the last filtration level, where the attractive and repulsive force vectors are given by:”
MethodDrawing graphs by eigenvectors: theory and practice
Koren, Y. (2005) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2004.08.015 · Cited by 165
“, [14, 15].”
Web Science 2.0: Identifying Trends through Semantic Social Network Analysis
Gloor, P. A., Krauss, J. S., Nann, S., Fischbach, K., & Schoder, D. (2009) · doi:10.1109/cse.2009.186 · Cited by 165
“All networks in this and subsequent figures are visualized with the Fruchterman-Rheingold graph layout algorithm [11].”
MethodDetecting criminal organizations in mobile phone networks
Ferrara, E., De Meo, P., Catanese, S., & Fiumara, G. (2014) · Expert Systems with Applications · doi:10.1016/j.eswa.2014.03.024 · Cited by 164
Semantic Interaction for Sensemaking: Inferring Analytical Reasoning for Model Steering
Endert, A., Fiaux, P., & North, C. L. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.260 · Cited by 164
“The underlying force-directed model (modified from [26]) treats documents as nodes, and edges between nodes are created if one or more keyword entity co-occurs in both documents.”
BackgroundMapping the Themes, Impact, and Cohesion of Creativity Research over the Last 25 Years
Williams, R., Runco, M. A., & Berlow, E. L. (2016) · Creativity Research Journal · doi:10.1080/10400419.2016.1230358 · Cited by 164
“The network layout used a force-directed layout (Fruchterman & Reingold, 1991) modified to bring nodes assigned to the same cluster closer together by decreasing the repulsion between nodes that were in the same cluster.”
MethodThe current state of Subti Wiki, the database for the model organism Bacillus subtilis
Pedreira, T., Elfmann, C., & Stülke, J. (2022) · Nucleic Acids Research · doi:10.1093/nar/gkab943 · Cited by 163
“The gravity model (12) in which nodes (genes/proteins) are considered as mass points and edges (physical or regulatory interactions) as springs was preserved for both browsers and the user can find a clear and intuitive integration of the expression data within networks (Figure 3A).”
BackgroundGalderisi, S., Rucci, P., Mucci, A., Rossi, A., Rocca, P., Bertolino, A., Aguglia, E., Amore, M., Bellomo, A., Bozzatello, P., et al. (2020) · World Psychiatry · doi:10.1002/wps.20700 · Cited by 163
The Art and Science of Dynamic Network Visualization.
Bender‐deMoll, S., & McFarland, D. A. (2006) · Journal of Social Structure · Cited by 162
Effective information visualisation: a study of graph drawing aesthetics and algorithms
Purchase, H. C. (2000) · Interacting with Computers · doi:10.1016/s0953-5438(00)00032-1 · Cited by 163
“FD-FR: This force directed algorithm by Fruchterman and Reingold (1991) is based on an original idea by Eades (1984).”
MethodExtracting brand information from social networks: Integrating image, text, and social tagging data
Klostermann, J., Plumeyer, A., Böger, D., & Decker, R. (2018) · International Journal of Research in Marketing · doi:10.1016/j.ijresmar.2018.08.002 · Cited by 162
Characterizing gene tree conflict in plastome-inferred phylogenies
Walker, J. F., Stull, G. W., Walker‐Hale, N., Vargas, O. M., & Larson, D. A. (2019) · PeerJ · doi:10.7717/peerj.7747 · Cited by 162
ConceptGen: a gene set enrichment and gene set relation mapping tool
Sartor, M. A., Mahavisno, V., Keshamouni, V. G., Cavalcoli, J., Wright, Z., Karnovsky, A., Kuick, R., Jagadish, H. V., Mirel, B., Weymouth, T., et al. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btp683 · Cited by 161
Emergent dynamics of neuromorphic nanowire networks
Álvarez, A. D., Higuchi, R., Sanz‐Leon, P., Marcus, I., Shingaya, Y., Stieg, A. Z., Gimzewski, J. K., Kuncic, Z., & Nakayama, T. (2019) · Scientific Reports · doi:10.1038/s41598-019-51330-6 · Cited by 161
“A force-directed graph layout was used to better visualize the underlying topological structure of the electrical circuit formed by the nanowire network 45 .”
MethodACE: a fast multiscale eigenvectors computation for drawing huge graphs
Koren, Y., Carmel, L., & Harel, D. (2003) · IEEE Symposium on Information Visualization · doi:10.1109/infvis.2002.1173159 · Cited by 161
“Several such functions have been proposed, e.g., in [8, 18, 6, 10 ], each characterized by a different set of properties.”
BackgroundBibauw, S., François, T., & Desmet, P. (2019) · Computer Assisted Language Learning · doi:10.1080/09588221.2018.1535508 · Cited by 160
Functional architecture of reward learning in mushroom body extrinsic neurons of larval Drosophila
Saumweber, T., Rohwedder, A., Schleyer, M., Eichler, K., Chen, Y.-C., Aso, Y., Cardona, A., Eschbach, C., Kobler, O., Voigt, A., et al. (2018) · Nature Communications · doi:10.1038/s41467-018-03130-1 · Cited by 142
Chen, C. (2010) · Wiley Interdisciplinary Reviews Computational Statistics · doi:10.1002/wics.89 · Cited by 161
SCImago Graphica: a new tool for exploring and visually communicating data
Hassan-Montero, Y., De-Moya-Anegón, F., & Guerrero-Bote, V. P. (2022) · El Profesional de la información · doi:10.3145/epi.2022.sep.02 · Cited by 159
Koren, Y. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-45071-8_50 · Cited by 159
A gene expression atlas of the domestic pig
Freeman, T. C., Ivens, A., Baillie, J. K., Beraldi, D., Barnett, M. W., Dorward, D., Downing, A., Fairbairn, L., Kapetanovic, R., Raza, S., et al. (2012) · BMC Biology · doi:10.1186/1741-7007-10-90 · Cited by 159
“Graph layout was performed using a modified Fruchterman-Rheingold algorithm [66] in three-dimensional space in which nodes representing genes/transcripts are connected by weighted, undirected edges representing correlations above the selected threshold.”
MethodLeydesdorff, L., & Persson, O. (2010) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21347 · Cited by 158
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.