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 901–1,000 of 1,021
Štochl, J., Soneson, E., Wagner, A. P., Khandaker, G. M., Goodyer, I. M., & Jones, P. B. (2018) · Psychological Medicine · doi:10.1017/s0033291718003288 · Cited by 58
“The resulting networks were plotted using the spring layout (Fruchterman and Reingold, 1991) where more related edges are plotted closer together.”
MethodRiera, J. L., & Baldo, L. (2020) · Animal Microbiome · doi:10.1186/s42523-020-00054-4 · Cited by 59
“On the other hand, common network layout algorithms, such as the Fruchterman and Reingold force-directed algorithm (FR, [44]) are optimal for displaying network features, but are blind to spatial relations among added mapped features (diet, in our case).”
Aguilera‐Mendoza, L., Marrero‐Ponce, Y., García‐Jacas, C. R., Chávez, E., Beltran, J. A., Guillen-Ramirez, H., & Brizuela, C. A. (2020) · Scientific Reports · doi:10.1038/s41598-020-75029-1 · Cited by 58
“Particularly, the Fruchterman-Reingold algorithm 39 was the most suitable for drawing the network of anticancer dataset (Fig.”
BackgroundExtended network analysis: from psychopathology to chronic illness
Isvoranu, A., Abdin, E., Chong, S. A., Vaingankar, J. A., Borsboom, D., & Subramaniam, M. (2021) · BMC Psychiatry · doi:10.1186/s12888-021-03128-y · Cited by 58
“The layout of the network is based on the FruchtermanReingold algorithm [21], which places nodes with Isvoranu et al.”
MethodLevi-Belz, Y., Greene, T., & Zerach, G. (2020) · European Journal of Psychotraumatology · doi:10.1080/20008198.2020.1736411 · Cited by 57
“The network layout is based on the Fruchterman-Reingold algorithm that forces strongly correlated nodes closer together (Fruchterman & Reingold, 1991).”
MethodGroup-in-a-Box Layout for Multi-faceted Analysis of Communities
Rodrigues, E. M., Milic-Frayling, N., Smith, M., Shneiderman, B., & Hansen, D. (2011) · 2011 IEEE Third Int'l Conference on Privacy, Security, Risk and Trust and 2011 IEEE Third Int'l Conference on Social Computing · doi:10.1109/passat/socialcom.2011.139 · Cited by 57
“The Fruchterman-Reingold (FR) layout [9] belongs to that class of algorithms.”
BackgroundVerschoor, M., Albers, C. J., Poortinga, W., Böhm, G., & Steg, L. (2020) · Journal of Environmental Psychology · doi:10.1016/j.jenvp.2020.101435 · Cited by 57
Network analysis of anxiety and depression in the functionally impaired elderly
Yang, T., Guo, Z., Cao, X., Zhu, X., Zhou, Q., Li, X., Wang, H., Wang, X., Wu, L., Wu, S., et al. (2022) · Frontiers in Public Health · doi:10.3389/fpubh.2022.1067646 · Cited by 57
Drago, H. F., de Moura, G. L., da Silva, L. S. C. V., da Veiga, C. P., Kaczam, F., Rita, L. P. S., & da Silva, W. V. (2022) · SN Business & Economics · doi:10.1007/s43546-022-00392-2 · Cited by 59
Symptoms of internet gaming disorder and depression in Chinese adolescents: A network analysis
Sit, H. F., Chang, C. I., Yuan, G. F., Chen, C., Cui, L., Elhai, J. D., & Hall, B. J. (2023) · Psychiatry Research · doi:10.1016/j.psychres.2023.115097 · Cited by 57
Boido, D., Kapetis, D., Gnatkovsky, V., Pastori, C., Galbardi, B., Sartori, I., Tassi, L., Cardinale, F., Francione, S., & de Curtis, M. (2014) · Human Brain Mapping · doi:10.1002/hbm.22516 · Cited by 57
Peltason, L., Hu, Y., & Bajorath, J. (2009) · ChemMedChem · doi:10.1002/cmdc.200900300 · Cited by 57
Algorithms for Labeling Focus Regions
Fink, M., Haunert, J., Schulz, A., Spoerhase, J., & Wolff, A. (2012) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2012.193 · Cited by 57
Regulation of the transcriptional program by DNA methylation during human αβ T-cell development
Rodríguez, R. M. A., Suárez-Álvarez, B., Mosén-Ansorena, D., García-Peydró, M., Fuentes, P., García-León, M. J., González-Lahera, A., Cámara, N. M., Toribio, M. L., Aransay, A. M., et al. (2014) · Nucleic Acids Research · doi:10.1093/nar/gku1340 · Cited by 57
“The network was then exported to Gephi (32), whereupon the Fruchterman– Reingold clustering algorithm was used to derive the graph (33).”
MethodAn Examination of the Topology and Measurement of the Alexithymia Construct Using Network Analysis
Watters, C. A., Taylor, G. J., Quilty, L. C., & Bagby, R. M. (2016) · Journal of Personality Assessment · doi:10.1080/00223891.2016.1172077 · Cited by 57
Android application classification and anomaly detection with graph-based permission patterns
Sokolova, K., Pérez, C., & Lemercier, M. (2016) · Decision Support Systems · doi:10.1016/j.dss.2016.09.006 · Cited by 57
Zhu, Z., Hu, Y., Xing, W., Guo, M., Zhao, R., Han, S., & Wu, B. (2018) · Journal of Pain and Symptom Management · doi:10.1016/j.jpainsymman.2018.11.011 · Cited by 57
Blumschein, P., Hung, W., Jonassen, D. H., & Ströbel, J. (2009) · BRILL eBooks · doi:10.1163/9789087907112 · Cited by 57
Ren, L., Wei, Z., Li, Y., Cui, L., Wang, Y., Wu, L., Wei, X., Peng, J., Li, K., Jin, Y., et al. (2021) · BMC Psychiatry · doi:10.1186/s12888-021-03455-0 · Cited by 57
Energy-Based Clustering of Graphs with Nonuniform Degrees
Noack, A. (2006) · Lecture notes in computer science · doi:10.1007/11618058_28 · Cited by 57
“Edge Repulsion In many force and energy models, including those of Eades [7] and Fruchterman and Reingold [8], adjacent nodes attract and all pairs of nodes repulse.”
MethodInfluentialSimple algorithms for network visualization: A tutorial
McGuffin, M. J. (2012) · Tsinghua Science & Technology · doi:10.1109/tst.2012.6297585 · Cited by 57
“We will instead consider a class of algorithms based on force-directed layout [10, 11] for positioning the nodes.”
MethodSingle-source shortest paths with the parallel boost graph library
Edmonds, N., Breuer, A., Gregor, D., & Lumsdaine, A. (2009) · DIMACS series in discrete mathematics and theoretical computer science · doi:10.1090/dimacs/074/09 · Cited by 57
“Of the parallel graph libraries that have been reported in the literature [3, 13, 24], none provide the flexibility needed in a general-purpose library.”
BackgroundCurran, B., Higham, K., Ortiz, E., & Filho, D. V. (2018) · PLoS ONE · doi:10.1371/journal.pone.0199072 · Cited by 56
“Moreover, we apply community-detection methods [17, 18] in order to find clusters of politicians that share interests, and investigate the partisan composition of these communities.”
BackgroundMethodVisualization of Text Streams: A Survey
Šilić, A., & Bašić, B. D. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-15390-7_4 · Cited by 56
“Force-Directed Placement (FDP) [ 56 ] is an algorithm that has an analogy in a physical system of masses and springs.”
BackgroundJayawickreme, N., Mootoo, C., Fountain, C., Rasmussen, A., Jayawickreme, E., & Bertuccio, R. F. (2017) · Social Science & Medicine · doi:10.1016/j.socscimed.2017.08.027 · Cited by 56
Topic-Based Bengali Opinion Summarization
Das, A., & Bandyopadhyay, S. (2010) · International Conference on Computational Linguistics · Cited by 56
Using Graph Layout to Visualize Train Interconnection Data
Brandes, U., & Wagner, D. (1998) · Lecture notes in computer science · doi:10.1007/3-540-37623-2_4 · Cited by 56
Visualization of Network Concepts: The Impact of Working Memory Capacity Differences
Zhu, B., & Watts, S. A. (2009) · Information Systems Research · doi:10.1287/isre.1080.0215 · Cited by 56
Supporting Rich And Dynamic Communication In Large-Scale Collaborative Virtual Environments
Greenhalgh, C., & Benford, S. (1999) · PRESENCE Virtual and Augmented Reality · doi:10.1162/105474699566026 · Cited by 56
“The placement of the page regions is determined by the force-directed placement algorithm, a well-known physical simulation algorithm for drawing 3-D graph structures ( Fruchterman & Reingold, 1991 ).”
MethodSARS-CoV-2 Molecular Network Structure
Díaz, J. (2020) · Frontiers in Physiology · doi:10.3389/fphys.2020.00870 · Cited by 55
The item network and domain network of burnout in Chinese nurses
Wu, L., Ren, L., Wang, Y., Zhang, K., Fang, P., Liu, X., Yang, Q., Wang, X., Wu, S., & Peng, J. (2021) · BMC Nursing · doi:10.1186/s12912-021-00670-8 · Cited by 55
“Visualizations of the item and domain networks were derived from the Fruchterman–Reingold algorithm, which locate nodes with stronger and numerous connections near the center of the network and weakly associated nodes on the periphery [31].”
MethodZeng, J., Li, Y., Jin, G., Su, J., & Yao, H. (2022) · Environmental Science & Technology · doi:10.1021/acs.est.2c04730 · Cited by 56
Estimating within-school contact networks to understand influenza transmission
Potter, G. E., Handcock, M. S., Longini, I. M., & Halloran, M. E. (2012) · The Annals of Applied Statistics · doi:10.1214/11-aoas505 · Cited by 55
“The friendship network was plotted with a standard layout algorithm which places connected vertices closer and disconnected vertices farther away in order to reduce numbers of edge crossings and reflect inherent symmetry [Fruchterman and Reingold (1991)].”
MethodMedusa: A tool for exploring and clustering biological networks
Pavlopoulos, G. A., Hooper, S. D., Sifrim, A., Schneider, R., & Aerts, J. A. (2011) · BMC Research Notes · doi:10.1186/1756-0500-4-384 · Cited by 55
“The Fruchterman-Reingold [14] force directed layout algorithm tries to minimize the crossovers between the lines.”
BackgroundScalable Visualization of Semantic Nets using Power-Law Graphs
Hussain, A., Latif, K., Rextin, A. T., Hayat, A., & Alam, M. (2013) · Applied Mathematics & Information Sciences · doi:10.12785/amis/080145 · Cited by 55
“The graph layout is being adjust by using Fruchterman-Reingold (FR) Force Directed Algorithm [13].”
BackgroundMethodResultInfluentialOrganizational Data Classification Based on the Importance Concept of Complex Networks
Carneiro, M. G., & Zhao, L. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2017.2726082 · Cited by 55
Climate Change, Climate Extremes, and Global Food Production—Adaptation in the Agricultural Sector
Vogel, E., & Meyer, R. (2018) · Elsevier eBooks · doi:10.1016/b978-0-12-811891-7.00003-7 · Cited by 55
Ding, Y., Holmes, A., Javadi-Abhari, A., Franklin, D., Martonosi, M., & Chong, F. T. (2018) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2018.00072 · Cited by 55
“This force law is reflected in many typical graph drawing techniques as well, that aim to uniformly distribute graph vertices and edges [41,42].”
BackgroundSeabed Mapping: A Brief History from Meaningful Words
Menandro, P. S., & Bastos, A. C. (2020) · Geosciences · doi:10.3390/geosciences10070273 · Cited by 55
“The analysis performed considered the relations and co-occurrence (similar to Euclidean Distance) among the 100 most frequent words, and the graphic chosen for this result was “Fruchterman Reingold (force-directed layout algorithm—the default for Iramuteq—which considers the connection thickness between the words to d…”
MethodBridging Anxiety and Depression: A Network Approach in Anxious Adolescents
Dobson, E. T., Croarkin, P. E., Schroeder, H. K., Varney, S. T., Mossman, S. A., Cecil, K. M., & Strawn, J. R. (2020) · Journal of Affective Disorders · doi:10.1016/j.jad.2020.11.027 · Cited by 55
On the faithfulness of graph visualizations
Nguyen, Q., Eades, P., & Hong, S. (2013) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2013.6596147 · Cited by 55
Johnson, R., Ding, Y., Venkateswaran, V., Bhattacharya, A., Boulier, K. M., Chiu, A. M., Knyazev, S., Schwarz, T., Freund, M. K., Zhan, L., et al. (2022) · Genome Medicine · doi:10.1186/s13073-022-01106-x · Cited by 55
Visual analysis of network centralities
Dwyer, T., Hong, S., Koschützki, D., Schreiber, F., & Xu, K. (2006) · Cited by 55
Udanor, C. N., Aneke, S., & Ogbuokiri, B. (2016) · Data Technologies and Applications · doi:10.1108/prog-02-2016-0011 · Cited by 55
Wang, X., & Miyamoto, I. (1996) · Lecture notes in computer science · doi:10.1007/bfb0021835 · Cited by 55
“In the paper, we first discussed how to revise the force-directed placement in [6] to generate compact layouts for graphs with vertices of different sizes.”
BackgroundMethodInfluentialDomain-retargetable reverse engineering
Tilley, S. R., Müller, H. A., Whitney, M. J., & Wong, K. K. (2002) · IEEE International Conference on Software Maintenance (ICSM) · doi:10.1109/icsm.1993.366948 · Cited by 55
Network Analysis of World Trade Using the BACI-CEPII DatasetPreprint
Benedictis, L. D., Nenci, S., Santoni, G., Tajoli, L., & Vicarelli, C. (2014) · SSRN Electronic Journal · doi:10.2139/ssrn.2374354 · Cited by 55
Discovery of disease-adapted bacterial lineages in inflammatory bowel diseases
Kumbhari, A., Cheng, T. N. H., Ananthakrishnan, A. N., Kochar, B., Burke, K. E., Shannon, K., Lau, H., Xavier, R. J., & Smillie, C. S. (2024) · Cell Host & Microbe · doi:10.1016/j.chom.2024.05.022 · Cited by 54
Andrews, J. L., Li, M., Minihan, S., Songco, A., Fox, E., Ladouceur, C. D., Mewton, L., Moulds, M., Pfeifer, J. H., Van Harmelen, A.-L., et al. (2023) · BMC Psychiatry · doi:10.1186/s12888-023-04734-8 · Cited by 54
Visual Exploration of Changes in Passenger Flows and Tweets on Mega-City Metro Network
Itoh, M., Yokoyama, D., Toyoda, M., Tomita, Y., Kawamura, S., & Kitsuregawa, M. (2016) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2016.2546301 · Cited by 54
“We adopt an automatic and dynamic graph layout algorithm based on a force-directed model [34] to visualize bubble charts.”
MethodThe Core-Periphery Problem in Communication Research: A Network Analysis of Leading Publication
Demeter, M. (2017) · Publishing Research Quarterly · doi:10.1007/s12109-017-9535-2 · Cited by 54
“…and the centrality dimensions (diameter, beta-index, degree centrality, and graph density) of the whole corpus in Fruchterman–Reingold layout [8], we further analyzed giant components, graph hubs and their rates for eccentricity, eigenvector centrality, and Watts–Strogatz clustering…”
BackgroundForce-directed algorithms for schematic drawings and placement: A survey
Cheong, S.-H., & Si, Y. (2019) · Information Visualization · doi:10.1177/1473871618821740 · Cited by 54
“For example, the GPU parallel computing framework(37) was proposed for identifying the k-nearest neighbours, the results of which were then utilised to speed up the FR algorithm.(2) A distributed force-directed algorithm in an open-source distributed computing framework called Giraph (http://giraph.”
BackgroundMethodMiers, A. C., Weeda, W. D., Blöte, A. W., Cramer, A. O. J., Borsboom, D., & Westenberg, P. M. (2019) · Journal of Abnormal Psychology · doi:10.1037/abn0000484 · Cited by 55
Hietajärvi, L., Lonka, K., Hakkarainen, K., Alho, K., & Salmela‐Aro, K. (2020) · Frontline Learning Research · doi:10.14786/flr.v8i1.437 · Cited by 56
López, B. D. (2020) · Animal Behaviour · doi:10.1016/j.anbehav.2020.03.001 · Cited by 54
van Buitenen, N., van den Berg, C. J. W., Meijers, J., & Harte, J. M. (2020) · European Psychiatry · doi:10.1192/j.eurpsy.2020.63 · Cited by 54
“In the visualization of the network, the Fruchterman–Reingold algorithm was used, which places strongly connected nodes close to each other [25,27].”
MethodMartins, C., Bandeira, P. F. R., Lemos, N. B. A. G., Bezerra, T. A., Clark, C. C. T., Mota, J. A. P. S., & Duncan, M. J. (2020) · International Journal of Environmental Research and Public Health · doi:10.3390/ijerph17238861 · Cited by 54
“Data were shown in the relative space in which variables with stronger permanent association remain together and with less strongly applied variations repelled one another [41].”
BackgroundChagas, J. K. M., de Figueiredo, C. C., & Paz‐Ferreiro, J. (2021) · Geoderma · doi:10.1016/j.geoderma.2021.115323 · Cited by 54
Measuring the Private and Social Returns to R&D: Unintended Spillovers versus Technology Markets
Arqué‐Castells, P., & Spulber, D. F. (2022) · Journal of Political Economy · doi:10.1086/719908 · Cited by 54
“Nodes are arranged following the Fruchterman and Reingold (1991) algorithm.”
MethodLópez‐Pernas, S., Saqr, M., & Apiola, M. (2023) · Springer eBooks · doi:10.1007/978-3-031-25336-2_5 · Cited by 54
Force-Directed Graph Drawing Using Social Gravity and Scaling
Bannister, M. J., Eppstein, D., Goodrich, M. T., & Trott, L. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36763-2_37 · Cited by 54
Peláez-Ballestas, I. D. P., Granados, Y., Quintana, R., Sánchez, A. L., Julián-Santiago, F., Rosillo, C., Gastelum‐Strozzi, A., Álvarez-Nemegyei, J., Santana, N., Silvestre, A. M. R., et al. (2018) · Annals of the Rheumatic Diseases · doi:10.1136/annrheumdis-2018-213625 · Cited by 54
Architecture and applications of the Hy+visualization system
Consens, M. P., Eigler, F. C., Hasan, M., Mendelzon, A. O., Noik, E. G., Ryman, A. G., & Vista, D. (1994) · IBM Systems Journal · doi:10.1147/sj.333.0458 · Cited by 54
“The simulation continues until a low-energy state is reached resulting in the nal layout; similar approaches have been described in [12, 15, 19].”
MethodSchulze, A., Cloos, L., Zdravkovic, M., Lis, S., & Krause-Utz, A. (2022) · Borderline Personality Disorder and Emotion Dysregulation · doi:10.1186/s40479-022-00206-9 · Cited by 53
TransGraph: Hierarchical Exploration of Transition Relationships in Time-Varying Volumetric Data
Gu, Y., & Wang, C. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.246 · Cited by 53
“We employ the Fruchterman-Reingold algorithm [ 10 ], a popular force-directed layout algorithm to all levels of TransGraph drawing.”
MethodA Network Analysis of Depressive Symptoms in Individuals Seeking Treatment for Chronic Pain
McWilliams, L. A., Sarty, G., Kowal, J., & Wilson, K. G. (2017) · The Clinical Journal of Pain · doi:10.1097/ajp.0000000000000477 · Cited by 46
Basole, R. C., Srinivasan, A., Park, H., & Patel, S. (2018) · ACM Transactions on Management Information Systems · doi:10.1145/3185047 · Cited by 53
Generating and Using Transcriptomically Based Retinal Cell Atlases
Shekhar, K., & Sanes, J. R. (2021) · Annual Review of Vision Science · doi:10.1146/annurev-vision-032621-075200 · Cited by 53
Banking Crises and Financial Integration
Caballero, J. (2013) · Journal of International Financial Markets Institutions and Money · doi:10.1016/j.intfin.2014.11.005 · Cited by 53
PaperVis: Literature Review Made Easy
Chou, J. ‐., & Yang, C. (2011) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2011.01921.x · Cited by 53
Locally adaptive dynamic networks
Durante, D., & Dunson, D. B. (2016) · The Annals of Applied Statistics · doi:10.1214/16-aoas971 · Cited by 53
Hitchers: Designing for Cellular Positioning
Drozd, A., Benford, S., Tandavanitj, N., Wright, M., & Chamberlain, A. (2006) · Lecture notes in computer science · doi:10.1007/11853565_17 · Cited by 53
“This graph is visualized using a well known force-directed placement algorithm [8] that is implemented in the Java JGraph library [16].”
MethodVisualising Changes in Fund Manager Holdings in Two and a Half-Dimensions
Dwyer, T., & Gallagher, D. R. (2004) · Information Visualization · doi:10.1057/palgrave.ivs.9500081 · Cited by 53
“arranged in the plane using a force directed placement algorithm [10, 14, 15 , 23].”
MethodDrawing the AS Graph in 2.5 Dimensions
Baur, M. N., Brandes, U., Gaertler, M., & Wagner, D. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31843-9_6 · Cited by 53
Puthucheary, Z., Brown, C., Corner, E. J., Wallace, S., Highfield, J. A., Bear, D. E., Rehill, N., Montgomery, H., Aitken, L. M., & Turner‐Stokes, L. F. (2021) · Journal of the Intensive Care Society · doi:10.1177/1751143720988708 · Cited by 52
“We used the force-directed Fruchterman-Reingold algorithm to determine the layout, which positions correlated nodes closer to one another(20).”
MethodТрач, Р., Khomenko, O., Trach, Y., Куліков, О., Druzhynin, M., Kishchak, N., Ryzhakova, G., Petrenko, H., Prykhodko, D., & Obodіanska, O. (2023) · Sustainability · doi:10.3390/su15075653 · Cited by 53
The mental map versus static aesthetic compromise in dynamic graphs: a user study
Saffrey, P., & Purchase, H. C. (2008) · ENLIGHTEN (Jurnal Bimbingan dan Konseling Islam) · Cited by 52
BUSINESS PROCESS VISUALIZATION – USE CASES, CHALLENGES, SOLUTIONS
Rinderle, S., Bobrik, R., Reichert, M., & Bauer, T. (2006) · International Conference on Enterprise Information Systems · doi:10.5220/0002452402040211 · Cited by 52
“In the literature there are also approaches dealing with general graphs, e.g., Heavy Duty Preprocessing, Spring Embedder ( Fruchterman and Reingold, 1991; Frick et al., 1994), etc., There are also a few approaches dealing with layouting process graphs (Six and Tollis, 2002; Yang et al., 2004; Diguglielmo et al., 2002).”
BackgroundSocial seed networks: Identifying central farmers for equitable seed access
Ricciardi, V. (2015) · Agricultural Systems · doi:10.1016/j.agsy.2015.07.002 · Cited by 52
Distribution of Reciprocal of Interatomic Distances: A Fast Structural Metric
Zhou, T., & Caflisch, A. (2012) · Journal of Chemical Theory and Computation · doi:10.1021/ct3003145 · Cited by 52
Design of Multitarget Activity Landscapes That Capture Hierarchical Activity Cliff Distributions
Dimova, D., Wawer, M. J., Wassermann, A. M., & Bajorath, J. (2011) · Journal of Chemical Information and Modeling · doi:10.1021/ci100477m · Cited by 52
Visual Adjacency Lists for Dynamic Graphs
Hlawatsch, M., Burch, M., & Weiskopf, D. (2014) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2014.2322594 · Cited by 52
Shaw, L., Harjunmaa, U., Doyle, R., Mulewa, S., Charlie, D., Maleta, K., Callard, R., Walker, A. S., Balloux, F., Ashorn, P., et al. (2016) · Applied and Environmental Microbiology · doi:10.1128/aem.01756-16 · Cited by 43
Extracting and Benchmarking Emerging Adverse Outcome Pathway Knowledge
Pollesch, N., Villeneuve, D. L., & O’Brien, J. M. (2019) · Toxicological Sciences · doi:10.1093/toxsci/kfz006 · Cited by 52
Evaluating the Readability of Force Directed Graph Layouts: A Deep Learning Approach
Haleem, H., Wang, Y., Puri, A., Wadhwa, S., & Qu, H. (2019) · IEEE Computer Graphics and Applications · doi:10.1109/mcg.2018.2881501 · Cited by 52
Deciphering Cell Fate Decision by Integrated Single-Cell Sequencing Analysis
Sagar, & Grün, D. (2020) · Annual Review of Biomedical Data Science · doi:10.1146/annurev-biodatasci-111419-091750 · Cited by 52
“There are various layout models available such as spring–electric and Fruchterman–Reingold (FR) layouts (66).”
MethodSearch Trajectory Networks of Population-Based Algorithms in Continuous Spaces
Ochoa, G., Malan, K. M., & Blum, C. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-43722-0_5 · Cited by 52
“Specifically, we considered force-directed layout algorithms, such as Fruchterman-Reignold [9] and KamadaKawai [11].”
BackgroundMethodMorrison, S. M., Buongiorno, J., Downs, R. T., Eleish, A. M., Fox, P., Giovannelli, D., Golden, J. J., Hummer, D. R., Hystad, G., Kellogg, L. H., et al. (2020) · Frontiers in Earth Science · doi:10.3389/feart.2020.00208 · Cited by 54
“The renderings of Fruchterman-Reingold force-directed (Fruchterman and Reingold, 1991; Csardi and Nepusz, 2006) mineral coexistence networks herein are of two types: unipartite and bipartite.”
Gomez, R., Stavropoulos, V., Tullett-Prado, D., Schivinski, B., & Chen, W. (2022) · BMC Psychiatry · doi:10.1186/s12888-022-03708-6 · Cited by 52
Genome instability drives epistatic adaptation in the human pathogen Leishmania
Bussotti, G., Piel, L., Pescher, P., Domagalska, M. A., Rajan, K. S., Cohen‐Chalamish, S., Doniger, T., Hiregange, D., Myler, P. J., Unger, R., et al. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2113744118 · Cited by 52
“2) (65), using the 655 “layout_with_fr” function, placing vertices on the plane using the force-directed layout algorithm 656 by Fruchterman and Reingold (66).”
Attending lectures in person, hybrid or online—how do students choose, and what about the outcome?
Kortemeyer, G., Dittmann-Domenichini, N., Schlienger, C., Spilling, E., Yaroshchuk, A., & Dissertori, G. (2023) · International Journal of Educational Technology in Higher Education · doi:10.1186/s41239-023-00387-5 · Cited by 53
“In particular, exploratory cluster analysis (R Core Team, 2018; Golino, 2022) and Fruchterman-Reingold (Fruchterman & Reingold, 1991; Bastian et al., 2009) representations based on cosine similarities (Watanabe & Can-noodt, 2022) between student-attribute vectors were used to identify the relationships between attribu…”
MethodA generic algorithm for layout of biological networks
Schreiber, F., Dwyer, T., Marriott, K., & Wybrow, M. (2009) · BMC Bioinformatics · doi:10.1186/1471-2105-10-375 · Cited by 52
Evaluating Multi-User Selection for Exploring Graph Topology on Wall-Displays
Prouzeau, A., Bezerianos, A., & Chapuis, O. (2016) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2592906 · Cited by 52
“several layout algorithms, such as classic force directed ones [16], [18], that position neighboring nodes close together and minimize edge crossings.”
BackgroundThe Genesis of Industrial Clusters
(2006) · Cluster Genesis · doi:10.1093/acprof:oso/9780199207183.003.0001 · Cited by 41
Designing Procedurally Generated Levels
van der Linden, R. (2013) · Research Repository (Delft University of Technology) · Cited by 52
Schaub, S. (2021) · Policy Sciences · doi:10.1007/s11077-021-09439-x · Cited by 51
Caught in a web of trauma: Network analysis of childhood adversity and adult mental ill-health
Breuer, F., Greggersen, W., Kahl, K. G., Schweiger, U., & Westermair, A. L. (2020) · Child Abuse & Neglect · doi:10.1016/j.chiabu.2020.104534 · Cited by 47
Feng, T., Wang, B., Mi, M., Ren, L., Wu, L., Wang, H., Liu, X., & Wang, X. (2025) · Heliyon · doi:10.1016/j.heliyon.2025.e41869 · Cited by 43
Zeiler, M., Philipp, J., Truttmann, S., Waldherr, K., Wagner, G., & Karwautz, A. (2021) · Nutrients · doi:10.3390/nu13114096 · Cited by 41
“The Fruchterman–Reingold algorithm [47] was used to organize the network plot.”
MethodDoes mindfulness change the mind? A novel psychonectome perspective based on Network Analysis
Roca, P., Diez, G. G., Castellanos, N., & Vazquez, C. (2019) · PLOS ONE · doi:10.1371/journal.pone.0219793 · Cited by 37
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.