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 301–400 of 1,021
Degrune, F., Theodorakopoulos, N., Colinet, G., Hiel, M.-P., Bodson, B., Taminiau, B., Daube, G., Vandenbol, M., & Hartmann, M. (2017) · Frontiers in Microbiology · doi:10.3389/fmicb.2017.01127 · Cited by 158
“The network was generated in Cytoscape 3.3.0 (Shannon et al., 2003) using the Allegro Fruchterman-Reingold algorithm (Fruchterman and Reingold, 1991).”
MethodInfluentialWawer, M. J., Peltason, L., Weskamp, N., Teckentrup, A., & Bajorath, J. (2008) · Journal of Medicinal Chemistry · doi:10.1021/jm800867g · Cited by 158
Stefanovski, L., Triebkorn, P., Spiegler, A., Díaz-Cortés, M.-A., Solodkin, A., Jirsa, V., McIntosh, A. R., Ritter, P., & Initiative, A. D. N. (2019) · Frontiers in Computational Neuroscience · doi:10.3389/fncom.2019.00054 · Cited by 159
The nature and building blocks of educational technology research
Valtonen, T., López-Pernas, S., Saqr, M., Vartiainen, H., Sointu, E. T., & Tedre, M. (2022) · Computers in Human Behavior · doi:10.1016/j.chb.2021.107123 · Cited by 112
Emotional intelligence and leadership: insights for leading by feeling in the future of work
Saha, S., Das, R., Lim, W. M., Kumar, S., Malik, A., & Chillakuri, B. K. (2023) · International Journal of Manpower · doi:10.1108/ijm-12-2021-0690 · Cited by 159
Visualizing the Electrical Structure of Power Systems
Cuffe, P., & Keane, A. (2015) · IEEE Systems Journal · doi:10.1109/jsyst.2015.2427994 · Cited by 157
“, [18]) can achieve this, and they have been deployed in this role [12], [19].”
BackgroundListen to Your Customers: Insights into Brand Image Using Online Consumer-Generated Product Reviews
Gensler, S., Völckner, F., Egger, M., Fischbach, K., & Schoder, D. (2015) · International Journal of Electronic Commerce · doi:10.1080/10864415.2016.1061792 · Cited by 157
Is RSSI a Good Choice for Localization in Wireless Sensor Network?
Heurtefeux, K., & Valois, F. (2012) · International Conference on Advanced Information Networking and Applications (AINA) · doi:10.1109/aina.2012.19 · Cited by 156
“As previously investigated, RSSI-based ranging is affected by errors due to the unpredictable radio propagation behavior.”
BackgroundLearning User Profiles from Tagging Data and Leveraging them for Personal(ized) Information Access
Michlmayr, E., & Cayzer, S. (2007) · The University of Bath Online Publications Store (The University of Bath) · Cited by 156
Fake identities in social media: A case study on the sustainability of the Facebook business model
Krombholz, K., Merkl, D., & Weippl, E. R. (2012) · Journal of Service Science Research · doi:10.1007/s12927-012-0008-z · Cited by 154
- Force-Directed Drawing Algorithms
Tamassia, R. (2013) · Chapman & Hall/CRC eBooks · doi:10.1201/b15385-15 · Cited by 152
Everyday prosociality in the workplace: The reinforcing benefits of giving, getting, and glimpsing.
Chancellor, J., Margolis, S., Jacobs Bao, K., & Lyubomirsky, S. (2018) · Emotion · doi:10.1037/emo0000321 · Cited by 118
Navigating Clustered Graphs Using Force-Directed Methods
Eades, P., & Huang, M. L. (2000) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00029 · Cited by 151
Dabdoub, S. M., Ganesan, S. M., & Kumar, P. S. (2016) · Scientific Reports · doi:10.1038/srep38993 · Cited by 131
E-Cigarette Surveillance With Social Media Data: Social Bots, Emerging Topics, and Trends
Allem, J.-P., Ferrara, E., Uppu, S. P., Cruz, T. B., & Unger, J. B. (2017) · JMIR Public Health and Surveillance · doi:10.2196/publichealth.8641 · Cited by 142
“Among Gephi’s visualization algorithms, we choose the Fruchterman Reingold force-directed layout [32].”
MethodAirborne microbial transport limitation to isolated Antarctic soil habitats
Archer, S. D. J., Lee, K. C. Y., Caruso, T., Maki, T., Lee, C. K., Cary, S. C., Cowan, D. A., Maestre, F. T., & Pointing, S. B. (2019) · Nature Microbiology · doi:10.1038/s41564-019-0370-4 · Cited by 150
Zhao, Y., Qu, D., Chen, S., & Chi, X. (2023) · Computers in Human Behavior · doi:10.1016/j.chb.2022.107424 · Cited by 125
Systematic Functional Annotation and Visualization of Biological Networks
Baryshnikova, A. (2016) · Cell Systems · doi:10.1016/j.cels.2016.04.014 · Cited by 148
Secular vs. Islamist polarization in Egypt on Twitter
Weber, I., Garimella, V. R. K., & Batayneh, A. (2013) · Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining · doi:10.1145/2492517.2492557 · Cited by 118
Exploring the big picture of smart city research
Komninos, N., & Mora, L. (2018) · Edinburgh Napier Research Repository (Edinburgh Napier University) · doi:10.14650/88815 · Cited by 150
“The graph is obtained by using the Fruchterman-Reingold layout algorithm provided by the open-source software Gephi (Fruchterman and Reingold, 1991).”
MethodNonparametric Bayes Modeling of Populations of Networks
Durante, D., Dunson, D. B., & Vogelstein, J. T. (2016) · Journal of the American Statistical Association · doi:10.1080/01621459.2016.1219260 · Cited by 147
“In fact, we obtain similar insights to those in the left plot of Figure 5 when plotting the network not in terms of the physical spatial location of the nodes in the brain but instead in terms of the inferred location using the posterior mean of Z; see Fruchterman and Reingold (1991) for details on network visualizati…”
BackgroundMethodInfluentialReview of statistical network analysis: models, algorithms, and software
Salter‐Townshend, M., White, A., Gollini, I., & Murphy, T. B. (2012) · Statistical Analysis and Data Mining The ASA Data Science Journal · doi:10.1002/sam.11146 · Cited by 146
Intrinsic functional network architecture of human semantic processing: Modules and hubs
Xu, Y., Lin, Q., Han, Z., He, Y., & Bi, Y. (2016) · NeuroImage · doi:10.1016/j.neuroimage.2016.03.004 · Cited by 146
“Network visualization was created using the Network Overview, Discovery and Exploration for Excel (Node XL, http://nodexl.codeplex. com) by the force-directed placement technique (Fruchterman and Reingold, 1991), in which the inter-nodal Euclidean distances reflected the graph-theoretic distance.”
MethodRefugees and Network Publics on Twitter: Networked Framing, Affect, and Capture
Σιαπέρα, Ε., Boudourides, M. A., Lenis, S., & Suiter, J. (2018) · Social Media + Society · doi:10.1177/2056305118764437 · Cited by 148
“Additionally, the graphs of all networks are generated by the Fruchterman–Reingold algorithm of force directed-placement (Fruchterman & Reingold, 1991).”
MethodCovid-19 pandemic and tail-dependency networks of financial assets
Le, T. H., Xuan, H., Nguyen, D. K., & Şensoy, A. (2020) · Finance research letters · doi:10.1016/j.frl.2020.101800 · Cited by 146
A fast multi-scale method for drawing large graphs
Harel, D., & Koren, Y. (2000) · Working Conference on Advanced Visual Interfaces (AVI) · doi:10.1145/345513.345353 · Cited by 146
System-wide mapping of peptide-GPCR interactions in C. elegans
Beets, I., Zels, S., Vandewyer, E., Demeulemeester, J., Caers, J., Baytemur, E., Courtney, A., Golinelli, L., Hasakioğulları, İ., Schafer, W. R., et al. (2023) · Cell Reports · doi:10.1016/j.celrep.2023.113058 · Cited by 146
Exploded Views for Volume Data
Brückner, S., & Groller, E. M. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.140 · Cited by 145
“In graph drawing, force-directed layout techniques model connectivity information through physical forces which can be simulated [12, 13 ].”
MethodKnowledge Mining With VxInsight: Discovery Through Interaction
Davidson, G. S., Hendrickson, B., Johnson, D. K., Meyers, C. E., & Wylie, B. (1998) · Journal of Intelligent Information Systems · doi:10.1023/a:1008690008856 · Cited by 144
Information visualization techniques for sensing and biosensing
Paulovich, F. V., de Moraes, M. L., Maki, R. M., Ferreira, M., Oliveira, O. N., & de Oliveira, M. C. F. (2011) · The Analyst · doi:10.1039/c0an00822b · Cited by 144
Bonati, M. R., Campi, R., & Segre, G. (2022) · Epidemiology and Psychiatric Sciences · doi:10.1017/s2045796022000051 · Cited by 143
“The Fruchterman – Reingold algorithm was used (Fruchterman and Reingold, 1991), in which a force-directed layout dissembles the graph as a system of a large quantity of nodes or vertices.”
Perkins, S. E., Cagnacci, F., Stradiotto, A., Arnoldi, D., & Hudson, P. J. (2009) · Journal of Animal Ecology · doi:10.1111/j.1365-2656.2009.01557.x · Cited by 143
A survey on students’ use of AI at a technical university
Balabdaoui, F., Dittmann-Domenichini, N., Grosse, H., Schlienger, C., & Kortemeyer, G. (2024) · Discover Education · doi:10.1007/s44217-024-00136-4 · Cited by 142
“7 Fruchterman-Reingold [12, 14] representation of the significant ( p 0.01 ) correlations [19] between the binary and Likert-scale attributes in Tables 1 and 2 Vol.:(0123456789) Discover Education (2024) 3:51 | https://doi.org/10.1007/s44217-024-00136-4 Case Study”
InfluentialLeydesdorff, L., Rafols, I., & Chen, C. (2013) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.22946 · Cited by 124
Verschuère, B., Grothe, S. V. G., Waldorp, L., Watts, A. L., Lilienfeld, S. O., Edens, J. F., Skeem, J. L., & Noordhof, A. (2017) · Journal of Abnormal Psychology · doi:10.1037/abn0000315 · Cited by 141
“The layout of the network was based on Fruchterman and Reingold (1991)’s algorithm, which places more influential nodes central to the network and stronger connected nodes closer together in the network.”
MethodA Fast Multi-scale Method for Drawing Large Graphs
Harel, D., & Koren, Y. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44541-2_18 · Cited by 140
Daebeler, A., Bodelier, P. L. E., Yan, Z., Hefting, M. M., Jia, Z., & Laanbroek, H. J. (2014) · The ISME Journal · doi:10.1038/ismej.2014.81 · Cited by 140
Applying social learning analytics to message boards in online distance learning: A case study
Hernández-García, Á., González-González, I., Jiménez‐Zarco, A. I., & Chaparro-Peláez, J. (2014) · Computers in Human Behavior · doi:10.1016/j.chb.2014.10.038 · Cited by 140
Bibliometric review of ecological network analysis: 2010–2016
Borrett, S. R., Sheble, L., Moody, J. W., & Anway, E. C. (2018) · Ecological Modelling · doi:10.1016/j.ecolmodel.2018.04.020 · Cited by 140
“…to maximize the correlation between network geo-desic distance (shortest path between nodes) and point distance in the layout space (i.e. physical distance between each pair in the fi gure), thereby highlighting the natural clusters and contours of the topic space (Fruchterman and Reingold, 1991).”
BackgroundRepresentation Learning for Natural Language Processing
Liu, Z., Lin, Y., & Sun, M. (2020) · Springer eBooks · doi:10.1007/978-981-15-5573-2 · Cited by 140
Mapping 50 Years of Small Group Research Through Small Group Research
Emich, K. J., Kumar, S., Lu, L., Norder, K. A., & Pandey, N. (2020) · Small Group Research · doi:10.1177/1046496420934541 · Cited by 141
“For visualization, we used a force-directed layout algorithm (Fruchterman & Reingold, 1991).”
MethodVenturini, T., Jacomy, M., & Pablo Jensen, B. (2019) · Big Data & Society · doi:10.1177/20539517211018488 · Cited by 139
“Figure 3 shows that the clustering of our jazz network is less discernible when spatialized with Fru¨chterman and Reingold (1991) layout (Figure 3 (a)) than with ForceAtlas2 (Figure 3(b)).”
BackgroundMethodGloor, P. A., Laubacher, R., Dynes, S., & Zhao, Y. (2003) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/956863.956875 · Cited by 139
Communicating centrality in policy network drawings
Brandes, U., Kenis, P., & Wagner, D. (2003) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2003.1196010 · Cited by 139
“Notable refinements of the basic spring embedder can be found in [20], [18], [16], [8].”
BackgroundUsing network science and text analytics to produce surveys in a scientific topic
Silva, F. N., Amancio, D. R., Bardosova, M., Costa, L. D. F., & Oliveira, O. N. (2016) · Journal of Informetrics · doi:10.1016/j.joi.2016.03.008 · Cited by 103
“In this study, the CN and PC citation networks were embedded in a 3D space using a force-directed method based on the Fruchterman-Reingold algo-rithm (Fruchterman and Reingold, 1991).”
MethodTixier, A. J. ‐., Hallowell, M. R., Rajagopalan, B., & Bowman, D. (2016) · Automation in Construction · doi:10.1016/j.autcon.2016.11.001 · Cited by 139
Graph Drawing by High-Dimensional Embedding
Harel, D., & Koren, Y. (2002) · Lecture notes in computer science · doi:10.1007/3-540-36151-0_20 · Cited by 138
GMap: Visualizing graphs and clusters as maps
Gansner, E. R., Hu, Y., & Kobourov, S. (2010) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2010.5429590 · Cited by 135
“Possible embedding algorithms include principal component analysis [22], multidimensional scaling (MDS) [25], a force-directed algorithm [ 15 ], or non-linear dimensionality reduction such as LLE [33] and Isomap [36].”
MethodVisualizing the marrow of science
Anegón, F. D. M., Vargas‐Quesada, B., Chinchilla‐Rodríguez, Z., Corera‐Álvarez, E., Muñoz-Fernández, F. J., & Herrero-Solana, V. (2007) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20683 · Cited by 136
“1 Pre-print of: Journal of the American Society for Information Science and Technology, 58 (14): 2167-2179 December 2007”
A semi-automatic approach to home video editing
Girgensohn, A., Boreczky, J. S., Chiu, P., Doherty, J., Foote, J. T., Golovchinsky, G., Uchihashi, S., & Wilcox, L. D. (2000) · ACM Symposium on User Interface Software and Technology (UIST) · doi:10.1145/354401.354415 · Cited by 136
“The spring model has been used for two-dimensional layout of objects (e.g., [ 7 ]).”
MethodEick, S. G., Graves, T., Karr, A. F., Mockus, A., & Schuster, P. (2002) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2002.995435 · Cited by 135
“(Length conveys node associations.) Network layout algorithms ( Fruchterman & Reingold, 1991; Gansner, et al., 1993; Munzner, 1997) attempt to locate strongly associated nodes near one another, which helps minimize link overplotting, but the problem remains severe.”
BackgroundJi, Y., Liu, P., & Conrad, R. (2018) · Soil Biology and Biochemistry · doi:10.1016/j.soilbio.2018.05.029 · Cited by 134
Clustering Software Artifacts Based on Frequent Common Changes
Beyer, D., & Noack, A. (2005) · IEEE International Conference on Program Comprehension (ICPC) · doi:10.1109/wpc.2005.12 · Cited by 134
Large scale cohesive subgraphs discovery for social network visual analysis
Zhao, F., & Tung, A. K. H. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2535568.2448942 · Cited by 134
Santos, H., Fried, E. I., Asafu‐Adjei, J., & Ruiz, R. J. (2017) · Research in Nursing & Health · doi:10.1002/nur.21784 · Cited by 115
“Nodes with many connections (i.e., high centrality) are placed in the middle of the graph, and nodes with few connections in the periphery (Fruchterman & Reingold, 1991).”
BackgroundLiu, C., Yao, H., Chapman, S. J., Su, J., & Wang, C. (2020) · Environment International · doi:10.1016/j.envint.2020.105834 · Cited by 133
Search trajectory networks: A tool for analysing and visualising the behaviour of metaheuristics
Ochoa, G., Malan, K. M., & Blum, C. (2021) · Applied Soft Computing · doi:10.1016/j.asoc.2021.107492 · Cited by 133
“These algorithms strive to satisfy the following generally accepted criteria [32]: • Vertices are distributed roughly evenly on the plane (a circle in the igraph implementation).”
BackgroundMethodThe Small Project Observatory: Visualizing software ecosystems
Lungu, M. F., Lanza, M., Gîrba, T., & Robbes, R. (2009) · Science of Computer Programming · doi:10.1016/j.scico.2009.09.004 · Cited by 133
“To identify clusters of collaborating developers, we represent the collaboration graph using a force-based layout [24].”
MethodGraph layout through the VCG tool: Extended abstract and system demonstration
Sander, G. (1995) · Lecture notes in computer science · doi:10.1007/3-540-58950-3_371 · Cited by 133
“In order to achieve a balanced layout, a node v must be placed in the middle of all adjacent nodes with edges to v. Good result come from the spring embedder or rubber band network algorithms, for instance [10] and [ 7 ]: The positions of nodes is determined by the forces imposed upon the nodes, e.g.”
BackgroundLuechtefeld, T., Maertens, A., Russo, D. P., Rovida, C., Zhu, H., & Hartung, T. (2016) · ALTEX · doi:10.14573/altex.1510053 · Cited by 132
Advances and challenges in assessing urban sustainability: an advanced bibliometric review
Marvuglia, A., Havinga, L. C., Heidrich, O., Fonseca, J. A., Gaitani, N., & Reckien, D. (2020) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2020.109788 · Cited by 133
Using social network analysis to understand online Problem-Based Learning and predict performance
Saqr, M., Fors, U., & Nouri, J. (2018) · PLOS ONE · doi:10.1371/journal.pone.0203590 · Cited by 107
Loet Leydesdorff, A. (2004) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20045 · Cited by 131
Interactive Relationship Discovery via the Semantic Web
Heim, P., Lohmann, S., & Stegemann, T. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-13486-9_21 · Cited by 129
Variational Bayesian inference for the Latent Position Cluster Model for network data
Salter‐Townshend, M., & Murphy, T. B. (2012) · Computational Statistics & Data Analysis · doi:10.1016/j.csda.2012.08.004 · Cited by 129
“In the published discussion of Handcock et al. (2007), the following contributions are amongst those made: • David Blei and Stephen E.”
BackgroundMethodNaderi, H., & Shojaei, A. (2023) · Automation in Construction · doi:10.1016/j.autcon.2023.104785 · Cited by 129
SmallWorlds: Visualizing Social Recommendations
Gretarsson, B., O'Donovan, J., Bostandjiev, S., Hall, C., & Höllerer, T. (2010) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01679.x · Cited by 112
Analogy in suffix rivalry: the case of English -ityand -ness
Arndt‐Lappe, S. (2014) · English Language and Linguistics · doi:10.1017/s136067431400015x · Cited by 128
Masi, A., Breen, E. J., Alvares, G. A., Glozier, N., Hickie, I. B., Hunt, A., Hui, J., Beilby, J., Ravine, D., Wray, J., et al. (2017) · Molecular Autism · doi:10.1186/s13229-017-0176-2 · Cited by 111
“For example, qgraph can draw a correlation network, not just as circular network but where strongly correlated nodes are drawn near each other [48].”
BackgroundQuantifying flexibility in thought: The resiliency of semantic networks differs across the lifespan
Cosgrove, A. L., Kenett, Y. N., Beaty, R. E., & Diaz, M. T. (2021) · Cognition · doi:10.1016/j.cognition.2021.104631 · Cited by 128
Kitty: sketching dynamic and interactive illustrations
Kazi, R. H., Chevalier, F., Grossman, T., & Fitzmaurice, G. W. (2014) · ACM Symposium on User Interface Software and Technology (UIST) · doi:10.1145/2642918.2647375 · Cited by 128
“We use a force-directed layout algorithm [5] to guarantee minimal distance between nodes, facilitating their selection.”
MethodFast Multidimensional Scaling Through Sampling, Springs and Interpolation
Morrison, A., Ross, G., & Chalmers, M. (2003) · Information Visualization · doi:10.1057/palgrave.ivs.9500040 · Cited by 128
Web-based SCADA display systems (WSDS) for access via Internet
Qiu, B., & Gooi, H. B. (2000) · IEEE Transactions on Power Systems · doi:10.1109/59.867159 · Cited by 128
Patent classifications as indicators of intellectual organization
Leydesdorff, L. (2008) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.20814 · Cited by 128
Schöbel, S., Schmitt, A., Benner, D., Saqr, M., Janson, A., & Leimeister, J. M. (2024) · Information Systems Frontiers · doi:10.1007/s10796-023-10375-9 · Cited by 127
“The country network was plotted using the Fruchterman Reingold layout algorithm, and each community was assigned a unique color (Fruchterman & Reingold, 1991), and communities of countries who collaborated were identified using the Louvain modularity (De Meo et al., 2011).”
MethodNetwork Analysis: A Novel Approach to Understand Suicidal Behaviour
De Beurs, D. (2017) · International Journal of Environmental Research and Public Health · doi:10.3390/ijerph14030219 · Cited by 116
Unpacking Rumination and Executive Control: A Network Perspective
Bernstein, E. E., Heeren, A., & McNally, R. J. (2017) · Clinical Psychological Science · doi:10.1177/2167702617702717 · Cited by 117
Using Administrative Data to Identify Naturally Occurring Networks of Physicians
Landon, B. E., Onnela, J.-P. “., Keating, N. L., Barnett, M. L., Paul, S., O’Malley, A. J., Keegan, T., & Christakis, N. A. (2013) · Medical Care · doi:10.1097/mlr.0b013e3182977991 · Cited by 127
A layout algorithm for undirected compound graphs
Doğrusöz, U., Giral, E., Çetintaş, A., Çivril, A., & Demir, E. (2008) · Information Sciences · doi:10.1016/j.ins.2008.11.017 · Cited by 127
“vergence schema. Our implementation, however, was mostly based on that of Fruchterman and Reingold [ 13 ].”
BackgroundMethodInfluentialPavlopoulos, G. A., Malliarakis, D., Papanikolaou, N., Θεοδοσίου, Θ., Enright, A. J., & Iliopoulos, I. (2015) · GigaScience · doi:10.1186/s13742-015-0077-2 · Cited by 127
“Clustering analysis was performed to detect cliques or highly connected regions within a graph, layout techniques such as Fruchterman-Reingold [17] were implemented to place nodes in positions where the cross-overs between the edges are minimized and topological analysis was used for detecting important nodes of the n…”
MethodTwenty-five years of The European Journal of Finance (EJF): a retrospective analysis
Burton, B., Kumar, S., & Pandey, N. (2020) · European Journal of Finance · doi:10.1080/1351847x.2020.1754873 · Cited by 126
Coping and resilience in adults: a cross-sectional network analysis
der Hallen, R. V., Jongerling, J., & Godor, B. P. (2020) · Anxiety Stress & Coping · doi:10.1080/10615806.2020.1772969 · Cited by 126
“All analyses were run in R 3.5.2 using the R-packages qgraph, bootnet, and networktools (Epskamp, 2017; Epskamp et al., 2018a; Fruchterman & Reingold, 1991; Jones et al., 2019; Opsahl et al., 2010).”
MethodInfluentialExperimental Human-Computer Interaction: A Practical Guide with Visual Examples
Purchase, H. C. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9780511844522 · Cited by 126
How Do Global Audiences Take Shape? The Role of Institutions and Culture in Patterns of Web Use
Taneja, H., & Webster, J. G. (2015) · Journal of Communication · doi:10.1111/jcom.12200 · Cited by 125
“This visualization based on the algorithm of Fruchterman and Reingold (1991) belongs to a class of visualization techniques known in graph theory as force directed graphs.”
MethodKruiger, J. F., Rauber, P., Martins, R. M., Kerren, A., Kobourov, S., & Telea, A. C. (2017) · Computer Graphics Forum · doi:10.1111/cgf.13187 · Cited by 125
Arena3D: visualization of biological networks in 3D
Pavlopoulos, G. A., O’Donoghue, S. I., Satagopam, V., Soldatos, T. G., Pafilis, E., & Schneider, R. (2008) · BMC Systems Biology · doi:10.1186/1752-0509-2-104 · Cited by 125
Using Mixed-Method Design and Network Analysis to Measure Development of Interagency Collaboration
Cross, J. E., Dickmann, E. M., Newman-Gonchar, R., & Fagan, J. M. (2009) · American Journal of Evaluation · doi:10.1177/1098214009340044 · Cited by 124
“The network image was exported as a scalable vector graphics (SVG) file into Inkscape (Open-Source, 2008) and layout of the network was produced using the Fruchterman-Reingold gravity optimization (Fruchterman & Reingold, 1991) with slight edits for clarity.”
MethodGravity-Inspired Graph Autoencoders for Directed Link Prediction
Salha-Galvan, G., Limnios, S., Hennequin, R., Tran, V.-A., & Vazirgiannis, M. (2019) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3357384.3358023 · Cited by 124
“Node separation is based on distances in the embedding, using Force Atlas 2 layout and Fruchterman-Reingold algorithm [12] on Gephi.”
MethodPhage-plasmids promote recombination and emergence of phages and plasmids
Pfeifer, E., & Rocha, E. P. C. (2024) · Nature Communications · doi:10.1038/s41467-024-45757-3 · Cited by 124
“Sincethemesh ofnodesandedgesishardtoscrutinize,wearrangedthenodesusinga force-based algorithm (Fruchterman-Reingold) 35 .”
MethodInfluentialFrewen, P. A., Schmittmann, V. D., Bringmann, L. F., & Borsboom, D. (2013) · European Journal of Psychotraumatology · doi:10.3402/ejpt.v4i0.20656 · Cited by 112
“Such values were not replaced, and all available data was submitted to statistical analysis.”
BackgroundMethodAngel, R., & Conrad, R. (2013) · Environmental Microbiology · doi:10.1111/1462-2920.12140 · Cited by 125
Matrix Zoom: A Visual Interface to Semi-External Graphs
Abello, J. M., & van Ham, F. (2005) · IEEE Symposium on Information Visualization · doi:10.1109/infvis.2004.46 · Cited by 124
“Because of its flexibility we have chosen a spring embedder algorithm [9, 7] to generate a layout.”
MethodDesmarais, B. A., Raja, R. J. L., & Kowal, M. S. (2014) · American Journal of Political Science · doi:10.1111/ajps.12106 · Cited by 123
The Use of Instant Messaging in Working Relationship Development: A Case Study
Cho, H.-K., Trier, M., & Kim, E. (2005) · Journal of Computer-Mediated Communication · doi:10.1111/j.1083-6101.2005.tb00280.x · Cited by 102
Multi-Level Graph Layout on the GPU
Frishman, Y., & Tal, A. (2007) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70580 · Cited by 123
“Third, a layout algorithm which combines the strengths of [ 8 , 23] is used.”
BackgroundMethodInfluentialOut of Africa: The organization of migrant smuggling across the Mediterranean
Campana, P. (2018) · European Journal of Criminology · doi:10.1177/1477370817749179 · Cited by 122
Clusters and maps of science journals based on bi‐connected graphs in Journal Citation Reports
Loet Leydesdorff, A. (2004) · Journal of Documentation · doi:10.1108/00220410410548144 · Cited by 122
Improved Force-Directed Layouts
Gansner, E. R., & North, S. C. (1998) · Lecture notes in computer science · doi:10.1007/3-540-37623-2_28 · Cited by 120
“There has been a variety of work on this class of algorithms[14, 10, 4, 9, 24, 2, 15, 13, 3], leading to some quite efficient algorithms that can handle “medium-sized” graphs.”
BackgroundMicro‐Level Interpretation of Exponential Random Graph Models with Application to Estuary Networks
Desmarais, B. A., & Cranmer, S. (2012) · Policy Studies Journal · doi:10.1111/j.1541-0072.2012.00459.x · Cited by 120
Heeren, A., & McNally, R. J. (2017) · Cognitive Therapy and Research · doi:10.1007/s10608-017-9876-3 · Cited by 119
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.