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 501–600 of 1,021
Schaper, S., & Louis, A. A. (2014) · PLoS ONE · doi:10.1371/journal.pone.0086635 · Cited by 90
Accounting for Emergence and Novelty in Boston and Bay Area Biotechnology*
Owen-Smith, J. D., & Powell, W. W. (2006) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199207183.003.0004 · Cited by 99
“repel each other and ties act as ‘springs’ that pull connected nodes closer together ( Fruchterman and Reingold 1991 ).”
BackgroundSymptoms of posttraumatic stress disorder in a clinical sample of refugees: a network analysis
Spiller, T. R., Schick, M., Schnyder, U., Bryant, R. A., Nickerson, A., & Morina, N. (2017) · European Journal of Psychotraumatology · doi:10.1080/20008198.2017.1318032 · Cited by 86
“Third, in order to visualize the estimated network, the FruchtermanReingold algorithm (Fruchterman & Reingold, 1991), which places nodes with more and/or stronger connections more closely together, was used.”
MethodChoi, K. W., Batchelder, A. W., Ehlinger, P. P., Safren, S. A., & O'Cleirigh, C. (2017) · Journal of Consulting and Clinical Psychology · doi:10.1037/ccp0000241 · Cited by 86
“The overall plot layout was arranged according to the Fruchterman & Reingold (1991) algorithm, which places the most strongly connected nodes in the center of the network and weakly connected nodes to the periphery of the network.”
Tail event driven networks of SIFIs
Chen, C. Y., Härdle, W. K., & Okhrin, Y. (2018) · Journal of Econometrics · doi:10.1016/j.jeconom.2018.09.016 · Cited by 97
Graph Drawing by Stochastic Gradient Descent
Zheng, J. X., Pawar, S. S., & Goodman, D. F. M. (2018) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2018.2859997 · Cited by 98
“One of the major reasons why previous force-directed algorithms, such as in [4], [9], [32], have become popular is how simple and intuitive the concept is.”
BackgroundA structural transition in physical networks
Dehmamy, N., Milanlouei, S., & Barabási, A.-Ĺ. (2018) · Nature · doi:10.1038/s41586-018-0726-6 · Cited by 97
An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs
Hachul, S., & Jünger, M. (2006) · Lecture notes in computer science · doi:10.1007/11618058_22 · Cited by 97
“T. M. J. Fruchterman and E. M. Reingold.”
MethodInfluentialThe human gene connectome as a map of short cuts for morbid allele discovery
Itan, Y., Zhang, S., Vogt, G., Abhyankar, A., Casadio, M., Nitschké, P., Fried, D., Quintana‐Murci, L., Abel, L., & Casanova, J. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1218167110 · Cited by 97
“The TLR3 connectome was visualized with the Fruchterman–Reingold force-directed algorithm, which placed the genes in a 2D space by means of 10,000 interations with the NetworkX package (25, 41).”
MethodA network analysis of body satisfaction of people with gender dysphoria
van de Grift, T. C., Cohen‐Kettenis, P. T., Elaut, E., Cuypere, G. D., Richter‐Appelt, H., Haraldsen, I., & Kreukels, B. P. C. (2016) · Body Image · doi:10.1016/j.bodyim.2016.04.002 · Cited by 97
Aspect windows, 3-D visualizations, and indirect comparisons of information retrieval systems
Swan, R. C., & Allan, J. (1998) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/290941.290987 · Cited by 97
Shaffer, J. B., Knežević, M., & Kalidindi, S. R. (2010) · International Journal of Plasticity · doi:10.1016/j.ijplas.2010.03.010 · Cited by 96
Rincent, R., Charcosset, A., & Moreau, L. (2017) · Theoretical and Applied Genetics · doi:10.1007/s00122-017-2956-7 · Cited by 96
“The networks were drawn with a Fruchterman and Reingold’s force-directed placement algorithm (Fruchterman and Reingold 1991) with the package “network” in R 2.14.0.”
MethodInfluentialKorhonen, V. A., Mattsson, M. T., Inkinen, M., & Toom, A. (2019) · Frontiers in Psychology · doi:10.3389/fpsyg.2019.01056 · Cited by 96
Prettejohn, B. J., Berryman, M. J., & McDonnell, M. D. (2011) · Frontiers in Computational Neuroscience · doi:10.3389/fncom.2011.00011 · Cited by 96
“These were created from simulation data using a “force-based” graph method similar to that of Fruchterman and Reingold (1991). works are characterized by identifiable clusters or modules of nodes, within which there are relatively dense numbers of edges.”
On integrating visualization techniques for effective software exploration
Storey, M.-A., Wong, K. K., Fracchia, F. D., & Müller, H. A. (2002) · doi:10.1109/infvis.1997.636784 · Cited by 96
Predicting Movie Success and Academy Awards through Sentiment and Social Network Analysis
Krauss, J. S., Nann, S., Simon, D. P., Fischbach, K., & Gloor, P. A. (2008) · AIS Electronic Library (AISeL) · Cited by 94
Bibliometric perspectives on medical innovation using the medical subject Headings of P ub M ed
Leydesdorff, L., Rotolo, D., & Ràfols, I. (2012) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.22715 · Cited by 95
DiffAni: Visualizing Dynamic Graphs with a Hybrid of Difference Maps and Animation
Rufiange, S., & McGuffin, M. J. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.149 · Cited by 95
Pyzer-Knapp, E. O., Simm, G. N., & Aspuru Guzik, A. (2016) · Materials Horizons · doi:10.1039/c5mh00282f · Cited by 88
Network analysis of mineralogical systems
Morrison, S. M., Liu, C., Eleish, A. M., Prabhu, A., Li, C., Ralph, J., Downs, R. T., Golden, J. J., Fox, P., Hummer, D. R., et al. (2017) · American Mineralogist · doi:10.2138/am-2017-6104ccbyncnd · Cited by 95
“Figure 1a illustrates a simplified Fruchterman-Reingold force-directed network (Fruchterman and Reingold 1991; Csardi and Nepusz 2006), representing 36 major rock-forming minerals that occur in holocrystalline intrusive igneous rocks, as described in Alfred Harker’s classic Petrology for Students…”
BackgroundPartitioning Approach to Visualization of Large Graphs
Batagelj, V., Mrvar, A., & Zaveršnik, M. (1999) · Lecture notes in computer science · doi:10.1007/3-540-46648-7_9 · Cited by 95
Takeda, Y., Kajikawa, Y., Sakata, I., & Matsushima, K. (2008) · Technovation · doi:10.1016/j.technovation.2007.12.006 · Cited by 95
Drawing graphs to convey proximity: an incremental arrangement method
Cohen, J. D. (1997) · ACM Transactions on Computer-Human Interaction · doi:10.1145/264645.264657 · Cited by 95
Do Parenting Practices and Child Disclosure Predict Parental Knowledge? A Meta-Analysis
Liu, D., Chen, D., & Brown, B. B. (2019) · Journal of Youth and Adolescence · doi:10.1007/s10964-019-01154-4 · Cited by 95
“The qgraph package implements Fruchterman and Reingold ’ s (1991) algo-rithm, which positions nodes with stronger correlations near the center of the network and those with weaker correlations near the periphery of the network.”
International research networks in pharmaceuticals: Structure and dynamics
Cantner, U., & Rake, B. (2013) · Research Policy · doi:10.1016/j.respol.2013.10.016 · Cited by 94
Weiss, M. N., Hultsch, H., Adam, I., Scharff, C., & Kipper, S. (2014) · Proceedings of the Royal Society B Biological Sciences · doi:10.1098/rspb.2014.0460 · Cited by 94
Andrews, K., Wohlfahrt, M., & Wurzinger, G. (2009) · International Conference on Information Visualisation (IV) · doi:10.1109/iv.2009.108 · Cited by 94
“The Semantic Graph Visualiser (SGV) implements a set of standard graph drawing algorithms on top of the JGraph graph library [8], including Sugiyama-style layered graph drawing [9, 17] and several variations of force-directed placement [2, 5].”
MethodCross-sectional networks of depressive symptoms before and after antidepressant medication treatment
Bos, F. M., Fried, E. I., Hollon, S. D., Bringmann, L. F., Dimidjian, S., DeRubeis, R. J., & Bockting, C. L. H. (2018) · Social Psychiatry and Psychiatric Epidemiology · doi:10.1007/s00127-018-1506-1 · Cited by 78
“Position of the nodes in the networks was initially based on the Fruchterman–Reingold algorithm, which places the nodes with stronger and/ or more connections closer together [31].”
MethodFinn, J. T., Brownscombe, J. W., Haak, C. R., Cooke, S. J., Cormier, R., Gagné, T. O., & Danylchuk, A. J. (2014) · Ecological Modelling · doi:10.1016/j.ecolmodel.2013.12.014 · Cited by 93
McElroy, E., Shevlin, M. E., Murphy, J., & McBride, O. (2018) · European Child & Adolescent Psychiatry · doi:10.1007/s00787-018-1128-x · Cited by 93
Exploring 3D DTI Fiber Tracts with Linked 2D Representations
Jianu, R., Demiralp, Ç., & Laidlaw, D. H. (2009) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2009.141 · Cited by 93
Fight Fungi with Fungi: Antifungal Properties of the Amphibian Mycobiome
Kearns, P. J., Fischer, S., Fernández‐Beaskoetxea, S., Gabor, C. R., Bosch, J., Bowen, J. L., Tlusty, M. F., & Woodhams, D. C. (2017) · Frontiers in Microbiology · doi:10.3389/fmicb.2017.02494 · Cited by 93
“We included sample types as their own nodes using the Fruchterman and Reingold (1991) algorithm for ease of visualization.”
MethodMultilayer network simplification: Approaches, models and methods
Interdonato, R., Magnani, M., Perna, D., Tagarelli, A., & Vega, D. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2020.100246 · Cited by 93
Network visualization with Nam, the VINT network animator
Estrin, D. L., Handley, M. J., Heidemann, J., McCanne, S., Xu, Y., & Yu, H. (2000) · Computer · doi:10.1109/2.881696 · Cited by 93
“The default is an automatic layout algorithm based on a spring-embedded model.(9) The algorithm assigns attractive forces on all links and repulsive forces between all nodes and tries to achieve balance through iteration.”
MethodThe Problem of Patent Thickets in Convergent Technologies
Clarkson, G., & DeKORTE, D. (2006) · Annals of the New York Academy of Sciences · doi:10.1196/annals.1382.014 · Cited by 92
“Force-directed placement techniques (Fruchterman and Reingold 1991) have been used to present arrangements identifying complex information spaces (Schroeder 1999), and Clarkson (2005) previously incorporated this technique into a network analytic computational”
MethodBi-Force: large-scale bicluster editing and its application to gene expression data biclustering
Sun, P. G., Speicher, N. K., Röttger, R., Guo, J., & Baumbach, J. (2014) · Nucleic Acids Research · doi:10.1093/nar/gku201 · Cited by 92
“Bi-Force is motivated by the well-known physics-inspired graph layout algorithm of Fruchterman and Reingold (27).”
MethodAnhedonia as a transdiagnostic symptom across psychological disorders: a network approach
Guineau, M. G., Ikani, N., Rinck, M., Collard, R. M., van Eijndhoven, P., Tendolkar, I., Schene, A. H., Becker, E. S., & Vrijsen, J. N. (2022) · Psychological Medicine · doi:10.1017/s0033291722000575 · Cited by 92
Truong, Q. C., Cervin, M., Choo, C. C., Numbers, K. T., Bentvelzen, A. C., Kochan, N. A., Brodaty, H., Sachdev, P. S., & Medvedev, O. N. (2023) · Psychogeriatrics · doi:10.1111/psyg.13069 · Cited by 92
Barttfeld, P., Wicker, B., Cukier, S., Navarta, S., Lew, S., Leiguarda, R., & Sigman, M. (2012) · Neuropsychologia · doi:10.1016/j.neuropsychologia.2012.09.047 · Cited by 80
“…states we observed a significant effect of group with no interaction between both factors: Effect of group in the Exteroceptive (F(1, 231) = 15,55; p < 0,001; mean typical = 0.4089; mean ASD = 0.3565), and Interoceptive (F(1,231) = 9.72; p <0.01; mean typical = 0.3772; mean ASD = 0.4205).”
BackgroundMethodInfluentialConnectivity-Based Localization of Large Scale Sensor Networks with Complex Shape
Lederer, S., Wang, Y., & Gao, J. (2008) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom.2008.130 · Cited by 92
A Systematic Review of Business-IT Alignment Research With Enterprise Architecture
Zhang, M., Chen, H., & Luo, A. (2018) · IEEE Access · doi:10.1109/access.2018.2819185 · Cited by 92
Network models of posttraumatic stress symptoms across trauma types
Benfer, N., Bardeen, J. R., Cero, I., Kramer, L. B., Whiteman, S. E., Rogers, T. A., Silverstein, M. W., & Weathers, F. W. (2018) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2018.07.004 · Cited by 78
Exploring the computing literature using temporal graph visualization
Erten, C., Harding, P. J., Kobourov, S., Wampler, K., & Yee, G. V. (2004) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.539245 · Cited by 92
van Rooijen, G., Isvoranu, A., Kruijt, O. H., van Borkulo, C. D., Meijer, C. J., Wigman, J. T. W., Ruhé, H. G., de Haan, L., Bruggeman, R., Cahn, W., et al. (2017) · Schizophrenia Research · doi:10.1016/j.schres.2017.07.035 · Cited by 91
“The layout used when computing the networks was derived from the FruchtermanReingold algorithm, which computes the optimal layout so that nodes with stronger and/ormore connections are placed closer andmore central to each other (Fruchterman and Reingold, 1991).”
MethodReanalysing the factor structure of the moral foundations questionnaire
Harper, C. A., & Rhodes, D. (2021) · British Journal of Social Psychology · doi:10.1111/bjso.12452 · Cited by 92
“Construct measurement within the context of the MFT usually takes the form of the Moral Foundations Questionnaire (MFQ;Graham et al., 2009). This is a 32-item scale (with only 30 of these being scored because of two ‘catch’ questions designed to identify inattentive or random responding). These items are divided into…”
BackgroundMethodInfluentialPutwain, D. W., Stockinger, K., von der Embse, N. P., Suldo, S. M., & Daumiller, M. H. (2021) · Journal of School Psychology · doi:10.1016/j.jsp.2021.08.001 · Cited by 91
Network analysis for modeling complex systems in SLA research
Freeborn, L., Andringa, S. J., Lunansky, G., & Rispens, J. (2022) · Studies in Second Language Acquisition · doi:10.1017/s0272263122000407 · Cited by 94
“Psychological networks are often plotted (by default) using the Fruchterman-Reingold algorithm (Fruchterman & Reingold, 1991), which places nodes with stronger connections closer together, and nodes with weaker connections further apart.”
Visualizing Fuzzy Overlapping Communities in Networks
Vehlow, C., Reinhardt, T., & Weiskopf, D. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.232 · Cited by 91
“Force-directed layout algorithms, such as the Fruchterman-Reingold model [18] or the Kamada-Kawai model [31], can reveal clusters.”
MethodEvolutionary analysis of the most polymorphic gene family in falciparum malaria
Otto, T. D., Assefa, S. A., Böhme, U., Sanders, M. J., Kwiatkowski, D. P., Pf3k consortium, Berriman, M., & Newbold, C. (2019) · Wellcome Open Research · doi:10.12688/wellcomeopenres.15590.1 · Cited by 90
Saheb, T., Amini, B., & Alamdari, F. K. (2021) · International Journal of Information Management Data Insights · doi:10.1016/j.jjimei.2021.100018 · Cited by 90
High-Dimensional Graphical Model Search with thegRapHDRPackage
de Abreu, G. C. G., Edwards, D., & Labouriau, R. (2010) · Journal of Statistical Software · doi:10.18637/jss.v037.i01 · Cited by 90
“The Fruchterman and Reingold (1991) algorithm is used to place the vertices in the plotting area (Csardi and Nepusz 2006).”
MethodLoet Leydesdorff, A. (2004) · Scientometrics · doi:10.1023/b:scie.0000027678.31097.e0 · Cited by 90
“* In this case of a large network, I used the algorithm of FRUCHTERMAN & REINGOLD (1991) for the representation in three dimensions.”
MethodRing Attractor Dynamics Emerge from a Spiking Model of the Entire Protocerebral Bridge
Kakaria, K. S., & de Bivort, B. L. (2017) · Frontiers in Behavioral Neuroscience · doi:10.3389/fnbeh.2017.00008 · Cited by 89
“We examined the topological arrangement of this network by using a force-directed algorithm (Fruchterman et al., 1990; Webb and Stone pers. comm.) to arrange nodes representing neuro n s.”
MethodBekhuis, E., Schoevers, R. A., van Borkulo, C. D., Rosmalen, J. G. M., & Boschloo, L. (2016) · Psychological Medicine · doi:10.1017/s0033291716001550 · Cited by 89
“The layout of the graph was based on the Fruchterman–Reingold algorithm, which iteratively computed the optimal layout; symptoms with stronger and/or more connections were placed closer to each other (Fruchterman & Reingold, 1991).”
MethodClusters of trauma types as measured by the Life Events Checklist for DSM–5.
Contractor, A. A., Weiss, N. H., Batley, P. N., & Elhai, J. D. (2020) · International Journal of Stress Management · doi:10.1037/str0000179 · Cited by 89
“The network’s graphical layout was based on the Fruchterman-Reingold algorithm (Fruchterman & Reingold, 1991); weaker nodes with fewer connections were placed further apart and stronger nodes with more connections were placed closer together (Hevey, 2018).”
MethodBeck, D., & Ferasso, M. (2022) · Sustainable Cities and Society · doi:10.1016/j.scs.2022.104316 · Cited by 90
Tibaná-Herrera, G., Bajón, M. T. F., & Anegón, F. D. M. (2018) · International Journal of Educational Technology in Higher Education · doi:10.1186/s41239-018-0103-4 · Cited by 89
“among the selected publications, plotted using the NodeXL tool with the forcedirect visualization algorithm of Fruchterman and Reingold (1991). As can be seen, the strongest relationships are between computer science and social sciences, and then between them and engineering and management sciences.”
Negative influences of Facebook use through the lens of network analysis
Faelens, L., Hoorelbeke, K., Fried, E., De Raedt, R., & Koster, E. H. W. (2019) · Computers in Human Behavior · doi:10.1016/j.chb.2019.02.002 · Cited by 68
3D geographic network displays
Cox, K. C., Eick, S. G., & He, T. (1996) · ACM SIGMOD Record · doi:10.1145/245882.245901 · Cited by 89
“Numerically solving the motion equations results in an incremental positioning that places related nodes close to each other [9].”
BackgroundA network approach to climate change anxiety and its key related features
Heeren, A., Mouguiama-Daouda, C., & McNally, R. J. (2023) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2022.102625 · Cited by 88
Yan, G. C., Watanabe, N. M., Shapiro, S. L., Naraine, M. L., & Hull, K. (2018) · European Sport Management Quarterly · doi:10.1080/16184742.2018.1517272 · Cited by 88
“Based on the Gephi results, the FruchtermanReingold algorithm (Fruchterman & Reingold, 1991) was used to construct a network map.”
MethodHu, Y., & Shi, L. (2015) · Wiley Interdisciplinary Reviews Computational Statistics · doi:10.1002/wics.1343 · Cited by 88
Defect detection in CT scans of cast aluminum parts: A machine vision perspective
Fuchs, P., Kröger, T., & Garbe, C. S. (2021) · Neurocomputing · doi:10.1016/j.neucom.2021.04.094 · Cited by 88
Zhou, Y., Wu, S., & Zhang, Z. (2022) · Energy Economics · doi:10.1016/j.eneco.2022.106319 · Cited by 88
Gajdoš, P., Ježowicz, T., Uher, V., & Dohnálek, P. (2015) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2015.07.006 · Cited by 88
Visualizing the Evolution of Communities in Dynamic Graphs
Vehlow, C., Beck, F., Auwärter, P., & Weiskopf, D. (2014) · Computer Graphics Forum · doi:10.1111/cgf.12512 · Cited by 88
Value Transformation in the Mobile Service Ecosystem: A Study of App Store Emergence and Growth
Basole, R. C., & Karla, J. (2012) · Service Science · doi:10.1287/serv.1120.0004 · Cited by 88
Large-Graph Layout Algorithms at Work: An Experimental Study
Hachul, S., & Jünger, M. (2007) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00150 · Cited by 88
“[7] T. Fruchterman and E. Reingold.”
InfluentialStereoscopic Highlighting: 2D Graph Visualization on Stereo Displays
Alper, B., Höllerer, T., Kuchera-Morin, J. C., & Forbes, A. G. (2011) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2011.234 · Cited by 88
“The initial 2D and 3D graph layouts were calculated using the Fruchterman-Reingold heuristic [ 11 ].”
MethodgFacet: A Browser for the Web of Data.
Heim, P., Ziegler, J., & Lohmann, S. (2008) · Cited by 88
The network of conscientiousness
Costantini, G., & Perugini, M. (2016) · Journal of Research in Personality · doi:10.1016/j.jrp.2016.10.003 · Cited by 88
Managing projects with distributed and embedded knowledge through interactions
Bosch‐Sijtsema, P. M., & Henriksson, L.-H. (2014) · International Journal of Project Management · doi:10.1016/j.ijproman.2014.02.005 · Cited by 87
The worldwide networks of spread of recorded alien species
Capinha, C., Essl, F., Porto, M., & Seebens, H. (2022) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2201911120 · Cited by 87
“We used the Fruchterman–Reingold algorithm to find a two-dimensional layout of the networks (48).”
The Landscape of Research on Prior Knowledge and Learning: a Bibliometric Analysis
Bittermann, A., McNamara, D. S., Simonsmeier, B. A., & Schneider, M. (2023) · Educational Psychology Review · doi:10.1007/s10648-023-09775-9 · Cited by 87
“The community detection algorithm (Fruchterman & Reingold, 1991) indicated that there are five communities of topics, each one shown in a differently colored shape in Figure 2.”
MethodYarime, M., Takeda, Y., & Kajikawa, Y. (2009) · Sustainability Science · doi:10.1007/s11625-009-0090-4 · Cited by 87
The rise and fall of R&D networks
Tomasello, M. V., Napoletano, M., Garas, A., & Schweitzer, F. (2016) · Industrial and Corporate Change · doi:10.1093/icc/dtw041 · Cited by 89
“The plots are produced using the igraph library4 for R, and the networks are displayed using the Fruchterman-Reingold algorithm (cf. Fruchterman and Reingold, 1991).”
MethodHighly-cited papers in software engineering: The top-100
Garousi, V., & Fernandes, J. M. (2015) · Information and Software Technology · doi:10.1016/j.infsof.2015.11.003 · Cited by 87
“Relating to mathematical foundations, graphs and graph drawing (in the context of SE) are the focus of [53].”
BackgroundInsomnia and Personality—A Network Approach
Dekker, K., Blanken, T. F., & Someren, E. J. W. V. (2017) · Brain Sciences · doi:10.3390/brainsci7030028 · Cited by 86
“The Fruchterman and Reingold [37] algorithm was used to topographically place the nodes in the network: variables with many strong connections were placed in the center of the network and variables with weaker connections are placed more at the periphery of the network [37].”
MethodPredictions of first passage times in sparse discrete fracture networks using graph-based reductions
Hyman, J. D., Hagberg, A. A., Srinivasan, G., Mohd-Yusof, J., & Viswanathan, H. (2017) · Physical review. E · doi:10.1103/physreve.96.013304 · Cited by 87
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs
Huang, M. L., & Eades, P. (1998) · Lecture notes in computer science · doi:10.1007/3-540-37623-2_29 · Cited by 87
“In this section, we briefly outline the force model [1, 2, 6, 7].”
MethodZhu, B., & Chen, H. (2005) · Annual Review of Information Science and Technology · doi:10.1002/aris.1440390111 · Cited by 87
Bridging the Gap: The Use of Pathfinder Networks in Visual Navigation
Chen, C. (1998) · Journal of Visual Languages & Computing · doi:10.1006/jvlc.1998.0083 · Cited by 87
“Force-directed graph-drawing algorithms belong to a class of algorithms for drawing undirected graphs (see e.g. Fruchterman and Reingold [ 21 ]).”
BackgroundPanigrahy, A., Schmithorst, V. J., Wisnowski, J. L., Watson, C. G., Bellinger, D. C., Newburger, J. W., & Rivkin, M. J. (2015) · NeuroImage: Clinical · doi:10.1016/j.nicl.2015.01.013 · Cited by 86
“For visualization purposes, the spring-loading technique (Fruchterman and Reingold, 1991) was used: graphs were modeled with each node as a positively-charged particle (repelling each other) but connected via springs, with spring constants equal to the connection strength.”
MethodChang, W. C., Wong, C. S. M., Or, P. C. F., Chu, A. O. K., Hui, C. L. M., Chan, S. K. W., Lee, E. H. M., Suen, Y. N., & Chen, E. Y. H. (2019) · Psychological Medicine · doi:10.1017/s0033291719002113 · Cited by 86
Jaular, L. M., Névo, N., Schessner, J. P., Tkach, M., Jouve, M. J., Dingli, F., Loew, D., Witwer, K. W., Ostrowski, M., Borner, G. H. H., et al. (2021) · The EMBO Journal · doi:10.15252/embj.2020105492 · Cited by 86
Structural Properties of Defects in Glassy Liquids
Cubuk, E. D., Schoenholz, S. S., Kaxiras, E., & Liu, A. J. (2016) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.6b02144 · Cited by 86
SmilesDrawer: Parsing and Drawing SMILES-Encoded Molecular Structures Using Client-Side JavaScript
Probst, D., & Reymond, J. (2017) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.7b00425 · Cited by 86
Kwon, O.-H., Crnovrsanin, T., & Ma, K. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2017.2743858 · Cited by 85
“We selected one from each group: Fruchterman-Reingold (FR) [32] from spring-electrical approaches and Kamada-Kawai (KK) [49] from energy-based approaches.”
BackgroundMethodLu, G., Zeng, L., Dong, S., Huang, L., Liu, G., Ostadhassan, M., He, W., Du, X., & Bao, C. (2023) · Marine and Petroleum Geology · doi:10.1016/j.marpetgeo.2023.106168 · Cited by 85
Analyzing Actors and Their Discussion Topics by Semantic Social Network Analysis
Gloor, P. A., & Zhao, Y. (2006) · International Conference on Information Visualisation (IV) · doi:10.1109/iv.2006.23 · Cited by 85
Pocock, M. J. O., Evans, D. M., Fontaine, C., Harvey, M. C., Julliard, R., McLaughlin, Ó. B., SILVERTOWN, J. W., Tamaddoni‐Nezhad, A., White, P. C. L., & Bohan, D. A. (2016) · Advances in ecological research/Advances in Ecological Research · doi:10.1016/bs.aecr.2015.10.006 · Cited by 85
“4G; Gibson et al., 2012), such as those based on repulsion (Fruchterman and Reingold, 1991) or spring embedding (Kamada and Kawai, 1989).”
BackgroundA symptom network structure of the psychosis spectrum
van Rooijen, G., Isvoranu, A., Meijer, C. J., van Borkulo, C. D., Ruhé, H. G., & de Haan, L. (2017) · Schizophrenia Research · doi:10.1016/j.schres.2017.02.018 · Cited by 85
“…layout of the graph, the Fruchterman-Reingold algorithm was used, which calculates the optimal layout so that symptoms with less strength and less connections are placed further apart and those with more and/or stronger connections are placed closer to each other (Fruchterman and Reingold, 1991).”
MethodBukenaite, A., Štochl, J., Mossaheb, N., Schäfer, M. R., Klier, C. M., Becker, J., Schloegelhofer, M., Papageorgiou, K., Montejo, A. L., Russo, D. A., et al. (2017) · Schizophrenia Research · doi:10.1016/j.schres.2017.02.017 · Cited by 85
“Inter-item correlations of the CAPE-P15 were visualized as a graphical network using Fruchterman–Reingold algorithm (Fruchterman and Reingold, 1991).”
MethodCunning, R., Gates, R. D., & Edmunds, P. J. (2017) · PeerJ · doi:10.7717/peerj.3472 · Cited by 84
Analysis of the evolution and collaboration networks of citizen science scientific publications
Pelacho, M., Ruiz, G., Sanz, F., Tarancón, A., & Clemente-Gallardo, J. (2020) · Scientometrics · doi:10.1007/s11192-020-03724-x · Cited by 84
“Kampal tool bases his graphical representations in Fruchterman and Reingold force-directed layout algorithm (Fruchterman and Reingold 1991) to achieve it.”
MethodPredictors of Health Information–Seeking Behavior: Systematic Literature Review and Network Analysis
Mirzaei, A., Aslani, P., Luca, E., & Schneider, C. R. (2021) · Journal of Medical Internet Research · doi:10.2196/21680 · Cited by 84
“See Multimedia Appendix 1 for further methods [38,39,48,49]”
Network analysis of multivariate data in psychological science
(2021) · Nature Reviews Methods Primers · doi:10.1038/s43586-021-00060-z · Cited by 84
How local is local? Determining the boundaries of local food in practice
Trivette, S. A. (2014) · Agriculture and Human Values · doi:10.1007/s10460-014-9566-7 · Cited by 84
Multi-model semantic interaction for text analytics
Bradel, L., North, C. L., House, L., & Leman, S. C. (2014) · IEEE Conference on Visual Analytics Science and Technology (VAST) · doi:10.1109/vast.2014.7042492 · Cited by 84
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.