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 101–200 of 1,021
Carlson, M. R., Zhang, B., Fang, Z., Mischel, P. S., Horvath, S., & Nelson, S. F. (2006) · BMC Genomics · doi:10.1186/1471-2164-7-40 · Cited by 342
“To visualize the network with Pajek, one needs to threshold the connection strengths.”
MethodInfluentialKumar, S., Morstatter, F., & Liu, H. (2014) · SpringerBriefs in Computer Science · doi:10.1007/978-1-4614-9372-3 · Cited by 333
Proikas-Cezanne, T., Waddell, S., Gaugel, A., Frickey, T., Lupas, A., & Nordheim, A. (2004) · Oncogene · doi:10.1038/sj.onc.1208331 · Cited by 332
“CLANS is an implementation of the Fruchterman–Reingold algorithm (Fruchterman and Reingold, 1991).”
MethodThe landscape of tumor cell states and ecosystems in diffuse large B cell lymphoma
Steen, C. B., Luca, B. A., Esfahani, M. S., Azizi, A., Sworder, B. J., Nabet, B. Y., Kurtz, D. M., Liu, C. L., Khameneh, F., Advani, R. H., et al. (2021) · Cancer Cell · doi:10.1016/j.ccell.2021.08.011 · Cited by 332
Comparing Community Structure to Characteristics in Online Collegiate Social Networks
Red, V., Kelsic, E. D., Mucha, P. J., & Porter, M. A. (2011) · SIAM Review · doi:10.1137/080734315 · Cited by 331
“[Color] (Left) A Fruchterman-Reingold visualization [10] of the largest connected component of the Caltech Facebook network.”
BackgroundCamacho, D., Panizo-LLedot, Á., Bello-Orgaz, G., Gonzalez-Pardo, A., & Cambria, E. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.05.009 · Cited by 329
Rincent, R., Laloë, D., Nicolas, S., Altmann, T., Brunel, D., Revilla, P., Rodríguez, V. M., Moreno-Gonzalez, J., Melchinger, A., Bauer, E., et al. (2012) · Genetics · doi:10.1534/genetics.112.141473 · Cited by 327
“The networks of the two panels were drawn with a Fruchterman and Reingold’s force-directed placement algorithm (Fruchterman and Reingold 1991) with the package “network” in R.”
MethodE-Mail as Spectroscopy: Automated Discovery of Community Structure within Organizations
Tyler, J. R., Wilkinson, D. M., & Huberman, B. A. (2005) · The Information Society · doi:10.1080/01972240590925348 · Cited by 327
Analysis of biological networks
(2017) · Molecular Data Analysis Using R · doi:10.1002/9781119165057.ch10 · Cited by 323
“Left: A visualization of the substrate graph using the freely available software package Pajek [9].”
BackgroundMethodInfluentialMining communities and their relationships in blogs: A study of online hate groups
Chau, M., & Xu, J. (2007) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2006.08.009 · Cited by 323
“Graph layout algorithms have been developed particularly for drawing aesthetically pleasing network presentations ( Fruchterman and Reingold , 1991 ) .”
BackgroundMethodInfluentialsemPlot: Unified Visualizations of Structural Equation Models
Epskamp, S. (2015) · Structural Equation Modeling: A Multidisciplinary Journal · doi:10.1080/10705511.2014.937847 · Cited by 321
Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm
Hachul, S., & Jünger, M. (2005) · Lecture notes in computer science · doi:10.1007/978-3-540-31843-9_29 · Cited by 318
“In order to save running time, the multilevel algorithms [7, 9, 17] use the gridvariant method of [6] or variations of [12] that are comparatively inaccurate approximative variations of the original single-level algorithms [6, 12].”
BackgroundMethodIntegrated Proteogenomic Characterization across Major Histological Types of Pediatric Brain Cancer
Petralia, F., Tignor, N., Reva, B., Koptyra, M., Chowdhury, S., Rykunov, D., Krek, A., Ma, W., Zhu, Y., Ji, J., et al. (2020) · Cell · doi:10.1016/j.cell.2020.10.044 · Cited by 317
Social media and depression symptoms: A network perspective.
Aalbers, G., McNally, R. J., Heeren, A., de Wit, S., & Fried, E. I. (2019) · Journal of Experimental Psychology: General · doi:10.1037/xge0000528 · Cited by 317
“We plotted all networks with the same layout, which we determined by averaging over the layout of all networks based on the Fruchterman-Reingold algorithm (Fruchterman & Reingold, 1991).”
MethodPaulovich, F. V., Nonato, L. G., Minghim, R., & Levkowitz, H. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2007.70443 · Cited by 316
Vandenbroucke, L., Weeda, W., Lee, N., Baeyens, D., Westfall, J., Figner, B., & Huizinga, M. (2018) · Frontiers in Psychology · doi:10.3389/fpsyg.2018.01572 · Cited by 315
From loss to loneliness: The relationship between bereavement and depressive symptoms.
Fried, E. I., Bockting, C., Arjadi, R., Borsboom, D., Amshoff, M., Cramer, A. O. J., Epskamp, S., Tuerlinckx, F., Carr, D., & Stroebe, M. (2015) · Journal of Abnormal Psychology · doi:10.1037/abn0000028 · Cited by 314
Galderisi, S., Rucci, P., Kirkpatrick, B., Mucci, A., Gibertoni, D., Rocca, P., Rossi, A., Bertolino, A., Strauss, G. P., Aguglia, E., et al. (2018) · JAMA Psychiatry · doi:10.1001/jamapsychiatry.2017.4607 · Cited by 312
Metrics for Graph Drawing Aesthetics
Purchase, H. C. (2002) · Journal of Visual Languages & Computing · doi:10.1006/jvlc.2002.0232 · Cited by 311
“* ITS (iterative constraint spring, grid based): based on the algorithm by Fruchterman and Reingold [10],”
MethodApproximated and User Steerable tSNE for Progressive Visual Analytics
Pezzotti, N., Lelieveldt, B. P. F., Maaten, L. V. D., Hollt, T., Eisemann, E., & Vilanova, A. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2570755 · Cited by 308
Visualization of Interfirm Relations in a Converging Mobile Ecosystem
Basole, R. C. (2009) · Journal of Information Technology · doi:10.1057/jit.2008.34 · Cited by 307
Visualizing Large-scale and High-dimensional Data
Tang, J., Liu, J., Zhang, M., & Mei, Q. (2016) · Proceedings of the 25th International Conference on World Wide Web · doi:10.1145/2872427.2883041 · Cited by 306
Understanding and constructing shared spaces with mixed-reality boundaries
Benford, S., Greenhalgh, C., Reynard, G., Brown, C., & Koleva, B. (1998) · ACM Transactions on Computer-Human Interaction · doi:10.1145/292834.292836 · Cited by 302
Li, F., & Du, T. C. (2011) · Decision Support Systems · doi:10.1016/j.dss.2010.12.007 · Cited by 301
“3 presents the relationship between bloggers in terms of groups, networks, and general interests using the Fruchterman–Reingold algorithm [15] in Pajekman (a program for the analysis and visualization of large networks, available at http://vlado.”
MethodSpringer Handbook of Science and Technology Indicators
(2019) · Springer Handbooks · doi:10.1007/978-3-030-02511-3 · Cited by 300
Identifying salient attributes of peer-to-peer accommodation experience
Tussyadiah, I. P., & Zach, F. (2017) · Journal of Travel & Tourism Marketing · doi:10.1080/10548408.2016.1209153 · Cited by 300
“The Jaccard Coefficient of a word pair A and B is: J A; Bð Þ ¼ A\ Bj j A[ Bj j (2) The layout of the networks is determined by the Fruchterman and Reingold (1991) algorithm, which uses a force-based graph-drawing technique to present networks in an aesthetically pleasing way.”
MethodGay, B., & Dousset, B. (2005) · Research Policy · doi:10.1016/j.respol.2005.07.001 · Cited by 299
Kaiser, T., Herzog, P., Voderholzer, U., & Brakemeier, E. (2021) · Depression and Anxiety · doi:10.1002/da.23136 · Cited by 296
“Node placement for the admission network was accomplished using the Fruchterman‐Rheingold method (Fruchterman & Reingold, 1991), which places nodes with stronger associations closer to each other.”
MethodConsistency and differences between centrality measures across distinct classes of networks
Oldham, S., Fulcher, B., Parkes, L., Arnatkevic̆iūtė, A., Suo, C., & Fornito, A. (2019) · PLOS ONE · doi:10.1371/journal.pone.0220061 · Cited by 296
“A forced-directed algorithm was used to visualize node roles in the context of the broader topology of the network [65].”
MethodNetwork Visualization by Semantic Substrates
Shneiderman, B., & Aris, A. (2006) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2006.166 · Cited by 293
“Eades [12] proposed the idea but the most common reference is to the refined Fruchterman-Reingold (FR) algorithm [14], with further refinements by many others [15].”
MethodSingle-cell trajectories reconstruction, exploration and mapping of omics data with STREAM
Chen, H., Albergante, L., Hsu, J. Y., Lareau, C. A., Lo Bosco, G., Guan, J., Zhou, S., Gorban, A. N., Bauer, D. E., Aryee, M. J., et al. (2019) · Nature Communications · doi:10.1038/s41467-019-09670-4 · Cited by 293
The analysis of social networks
O’Malley, A. J., & Marsden, P. V. (2008) · Health Services and Outcomes Research Methodology · doi:10.1007/s10742-008-0041-z · Cited by 293
“Algorithms including multidimensional scaling (Bartholomew et al. 2002) and spring embedders (Fruchterman and Reingold 1991) now are often used to position units/actors in Cartesian space by optimizing some function of the network data and the spatial coordinates for units.”
MethodMeta-analytic clustering of the insular cortex
Cauda, F., Costa, T., Torta, D. M. E., Sacco, K., D'Agata, F., Duca, S., Geminiani, G., Fox, P. T., & Vercelli, A. (2012) · NeuroImage · doi:10.1016/j.neuroimage.2012.04.012 · Cited by 292
“To this aim, we employed the Fruchterman– Reingold method (Fruchterman and Reingold, 1991).”
Costantini, G., Richetin, J., Preti, E., Casini, E., Epskamp, S., & Perugini, M. (2019) · Personality and Individual Differences · doi:10.1016/j.paid.2017.06.011 · Cited by 291
“The qgraph function in package qgraph includes several options to visualize the network, the “spring” layout corresponding to the Frutherman-Reingold visualization algorithm (Fruchterman & Reingold, 1991).”
MethodThe nature and transfer of cognitive skills
Taatgen, N. A. (2013) · Psychological Review · doi:10.1037/a0033138 · Cited by 288
“The graph layout was obtained through a graph-plotting algorithm by Fruchterman and Reingold (1991), which tries to optimize the layout such that the edges are as short as possible.”
MethodThe Network Structure of Symptoms of the Diagnostic and Statistical Manual of Mental Disorders
Boschloo, L., van Borkulo, C. D., Rhemtulla, M., Keyes, K. M., Borsboom, D., & Schoevers, R. A. (2015) · PLOS ONE · doi:10.1371/journal.pone.0137621 · Cited by 285
“The layout of the graph was based on the Fruchterman-Reingold algorithm, which iteratively computes the optimal layout so that symptoms with stronger and/or more connections are placed closer to each other [29].”
MethodTracking and predicting growth areas in science
Small, H. (2006) · Scientometrics · doi:10.1007/s11192-006-0132-y · Cited by 280
Börner, K., Sanyal, S., & Vespignani, A. (2007) · Annual Review of Information Science and Technology · doi:10.1002/aris.2007.1440410119 · Cited by 279
OpenOrd: an open-source toolbox for large graph layout
Martin, S., Brown, W. M., Klavans, R., & Boyack, K. W. (2011) · SPIE Proceedings · doi:10.1117/12.871402 · Cited by 278
Everton, S. F. (2012) · Cambridge University Press eBooks · doi:10.1017/cbo9781139136877 · Cited by 277
Visualising semantic spaces and author co-citation networks in digital libraries
Chen, C. (1999) · Information Processing & Management · doi:10.1016/s0306-4573(98)00068-5 · Cited by 276
“Graphical representations of Pathfinder networks are generated using force-directed graph-drawing algorithms (Fruchterman & Reingold, 1991; Kamada & Kawai, 1989).”
BackgroundMethodGLay: community structure analysis of biological networks
Su, G., Kuchinsky, A., Morris, J. H., States, D. J., & Meng, F. (2010) · Bioinformatics · doi:10.1093/bioinformatics/btq596 · Cited by 275
“Fruchterman Reingold (original, grid) (Fruchterman and Reingold, 1991) Efficient force-based algorithms, with the grid version optimized for large networks graphopt (GraphOPT http://www.”
MethodNORINE: a database of nonribosomal peptides
Caboche, S., Pupin, M., Leclere, V., Fontaine, A., Jacques, P., & Kucherov, G. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm792 · Cited by 273
Efficient discovery of overlapping communities in massive networks
Gopalan, P. K., & Blei, D. M. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1221839110 · Cited by 272
“Each community is labeled with its dominant classification; nodes are sized by their bridgeness (39); the local network is visualized using the Fruchterman–Reingold algorithm (46).”
Consistency of community detection in networks under degree-corrected stochastic block models
Zhao, Y., Levina, E., & Zhu, J. (2012) · The Annals of Statistics · doi:10.1214/12-aos1036 · Cited by 270
“The results are shown in Figure 5 (drawn using the igraph package in R [9] with the Fruchterman and Reingold layout [12]).”
MethodVisualizing Psychological Networks: A Tutorial in R
Jones, P. J., Mair, P., & McNally, R. J. (2018) · Frontiers in Psychology · doi:10.3389/fpsyg.2018.01742 · Cited by 270
“Most network studies in psychopathology have used the Fruchterman-Reingold (FR) algorithm to plot graphs (Fruchterman and Reingold, 1991).”
MethodNAViGaTOR: Network Analysis, Visualization and Graphing Toronto
Brown, K. R., Otasek, D., Ali, M., McGuffin, M. J., Xie, W., Devani, B., Toch, I. L. V., & Jurisica, I. (2009) · Bioinformatics · doi:10.1093/bioinformatics/btp595 · Cited by 269
“…layout using Graph Drawing with Intelligent Placement (GRIP; Gajer and Kobourov, 2002), which performs network layout in near linear time, and then continuously updates the layout of the graph using a multi-threaded grid-variant (Fruchterman and Reingold, 1991) of a force-directed layout algorithm.”
A Meta-Review of Indoor Positioning Systems
Mendoza-Silva, G. M., Torres-Sospedra, J., & Huerta, J. (2019) · Sensors · doi:10.3390/s19204507 · Cited by 269
“Figure 3 shows the resulting graph applied to all surveys, visualized using a force-directed approach [201].”
MethodVariation in Patient-Sharing Networks of Physicians Across the United States
Landon, B. E., Keating, N. L., Barnett, M. L., Onnela, J.-P., Paul, S., O’Malley, A. J., Keegan, T., & Christakis, N. A. (2012) · JAMA · doi:10.1001/jama.2012.7615 · Cited by 267
“Selected networks were visualized using the Fruchterman-Reingold algorithm.(18) Unadjusted differences in network measures across regions were assessed using 1-way analysis of variance.”
Stadler, C., Rexhepaj, E., Singan, V. R., Murphy, R. F., Pepperkok, R., Uhlén, M., Simpson, J. C., & Lundberg, E. (2013) · Nature Methods · doi:10.1038/nmeth.2377 · Cited by 265
When guests trust hosts for their words: Host description and trust in sharing economy
Tussyadiah, I. P., & Park, S. (2018) · Tourism Management · doi:10.1016/j.tourman.2018.02.002 · Cited by 264
Functional interpretation of single cell similarity maps
DeTomaso, D., Jones, M. G., Subramaniam, M., Ashuach, T., Ye, C. J., & Yosef, N. (2019) · Nature Communications · doi:10.1038/s41467-019-12235-0 · Cited by 264
“43,]44 ).”
A Guide to Conquer the Biological Network Era Using Graph Theory
Koutrouli, M., Karatzas, E., Paez-Espino, D., & Pavlopoulos, G. A. (2020) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2020.00034 · Cited by 264
“The Yifan-Hu layout can give aesthetically comparable representations to the ones produced by the widely used but time-consuming Fruchterman-Reingold (Fruchterman and Reingold, 1991), with much faster performance.”
MethodMapping Physician Networks with Self-Reported and Administrative Data
Barnett, M. L., Landon, B. E., O'Malley, A. J., Keating, N. L., & Christakis, N. A. (2011) · Health Services Research · doi:10.1111/j.1475-6773.2011.01262.x · Cited by 262
Green warehousing: Systematic literature review and bibliometric analysis
Bartolini, M., Bottani, E., & Grosse, E. H. (2019) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2019.04.055 · Cited by 260
Modularity clustering is force-directed layout
Noack, A. (2009) · Physical Review E · doi:10.1103/physreve.79.026102 · Cited by 258
Epskamp, S., Maris, G., Waldorp, L. J., & Borsboom, D. (2018) · The Wiley Handbook of Psychometric Testing · doi:10.1002/9781118489772.ch30 · Cited by 256
An overview of scientometric mapping for the safety science community: Methods, tools, and framework
Li, J., Goerlandt, F., & Reniers, G. (2021) · Safety Science · doi:10.1016/j.ssci.2020.105093 · Cited by 254
Evans, J. A., & Foster, J. G. (2011) · Science · doi:10.1126/science.1201765 · Cited by 252
Zeng, J., Cao, L., Chin, C.-H., Ren, H., Zhang, J. Z. H., & Zhu, T. (2020) · Physical Chemistry Chemical Physics · doi:10.1039/c9cp05091d · Cited by 252
Pluralistic Collapse: The “Oil Spill” Model of Mass Opinion Polarization
DellaPosta, D. (2020) · American Sociological Review · doi:10.1177/0003122420922989 · Cited by 250
“Figure 4 and all other network visualizations in this article were generated using the Fruchterman-Reingold spring-embedding algorithm (Fruchterman and Reingold 1991).”
MethodSingle-Cell Analysis of Regional Differences in Adult V-SVZ Neural Stem Cell Lineages
Mizrak, D., Levitin, H. M., Delgado, A. C., Crotet, V., Yuan, J., Chaker, Z., Silva-Vargas, V., Sims, P. A., & Doetsch, F. (2019) · Cell Reports · doi:10.1016/j.celrep.2018.12.044 · Cited by 248
Freeman, T. C., Goldovsky, L., Brosch, M., van Dongen, S., Mazière, P., Grocock, R. J., Freilich, S., Thornton, J., & Enright, A. J. (2007) · PLoS Computational Biology · doi:10.1371/journal.pcbi.0030206 · Cited by 248
“We use a highly optimised weighted Fruchter-man-Rheingold layout algorithm [25] to quickly determine a reasonable layout of the network (see Methods).”
MethodNetwork Analysis on Attitudes: A Brief Tutorial
Dalege, J., Borsboom, D., van Harreveld, F., & van der Maas, H. L. J. (2017) · Social Psychological and Personality Science · doi:10.1177/1948550617709827 · Cited by 248
Co-authorship networks: a review of the literature
Kumar, S. (2015) · Aslib Journal of Information Management · doi:10.1108/ajim-09-2014-0116 · Cited by 247
An interactive reference framework for modeling a dynamic immune system
Spitzer, M. H., Gherardini, P. F., Fragiadakis, G. K., Bhattacharya, N., Yuan, R. T., Hotson, A. N., Finck, R., Carmi, Y., Zunder, E. R., Fantl, W. J., et al. (2015) · Science · doi:10.1126/science.1259425 · Cited by 246
Semantic interaction for visual text analytics
Endert, A., Fiaux, P., & North, C. (2012) · Proceedings of the SIGCHI Conference on Human Factors in Computing Systems · doi:10.1145/2207676.2207741 · Cited by 244
ChatGPT in education: a discourse analysis of worries and concerns on social media
Li, L., Ma, Z., Fan, L., Lee, S., Yu, H., & Hemphill, L. (2024) · Education and Information Technologies · doi:10.1007/s10639-023-12256-9 · Cited by 141
Tang, S., Zhao, H., Lu, S., Yu, L., Zhang, G., Zhang, Y., Yang, Q.-Y., Zhou, Y., Wang, X., Ma, W., et al. (2021) · Molecular Plant · doi:10.1016/j.molp.2020.12.003 · Cited by 242
Network Analysis Highlights Complex Interactions between Pathogen, Host and Commensal Microbiota
Boutin, S., Bernatchez, L., Audet, C., & Derôme, N. (2013) · PLoS ONE · doi:10.1371/journal.pone.0084772 · Cited by 239
Tools for visually exploring biological networks
Suderman, M., & Hallett, M. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm401 · Cited by 237
“The drawings are also known asspring embeddings [Eades, 1984, Fruchterman and Reingold, 1991, Frick et al., 1994, Kamada and Kawai, 1989] since edges are modeled as springs that pull linked nodes together, or push unlinked nodes apart, until the layout reaches a state of equillibrium (e.g. see…”
BackgroundMethodmgm: Estimating Time-Varying Mixed Graphical Models in High-Dimensional Data
Haslbeck, J. M. B., & Waldorp, L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.06871 · Cited by 66
“The layout was computed with the Fruchterman Reingold algorithm (Fruchterman and Reingold 1991), which places nodes such that all the edges are of more or less equal length and there are as few crossing edges as possible.”
MethodEnergy Models for Graph Clustering
Noack, A. (2007) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00154 · Cited by 234
Generating high-coverage semantic orientation lexicons from overtly marked words and a thesaurus
Mohammad, S., Dunne, C., & Dorr, B. (2009) · Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing Volume 2 - EMNLP '09 · doi:10.3115/1699571.1699591 · Cited by 233
Reticulate Representation of Evolutionary and Functional Relationships between Phage Genomes
Lima-Mendez, G., Van Helden, J., Toussaint, A., & Leplae, R. (2008) · Molecular Biology and Evolution · doi:10.1093/molbev/msn023 · Cited by 231
“A force-directed layout algorithm (Fruchterman and Reingold 1991) places the nodes based on their connections, grouping the most highly connected regions of the graph.”
BackgroundModel-Based Clustering and Classification for Data Science: With Applications in R
Bouveyron, C., Celeux, G., Murphy, T. B., & Raftery, A. E. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108644181 · Cited by 230
Zhu, B., & Stülke, J. (2018) · Nucleic Acids Research · doi:10.1093/nar/gkx908 · Cited by 230
“For this purpose, we selected a gravity model (9), in which nodes are considered as mass points and edges as springs.”
MethodA fast adaptive layout algorithm for undirected graphs (extended abstract and system demonstration)
Frick, A., Ludwig, A., & Mehldau, H. (1995) · Lecture notes in computer science · doi:10.1007/3-540-58950-3_393 · Cited by 228
“2 This is the same as the “optimal” edge length of [6].”
BackgroundMethodResultInfluentialQuantifying Correlations Between Allosteric Sites in Thermodynamic Ensembles
McClendon, C. L., Friedland, G., Mobley, D. L., Amirkhani, H., & Jacobson, M. P. (2009) · Journal of Chemical Theory and Computation · doi:10.1021/ct9001812 · Cited by 227
Tag-Cloud Drawing: Algorithms for Cloud VisualizationPreprint
Owen Kaser, B., & Daniel Lemire, A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0703109 · Cited by 227
“Force-directed methods have been adapted for graph drawing [10, 13].”
MethodHive plots--rational approach to visualizing networks
Krzywinski, M., Birol, I., Jones, S. J., & Marra, M. A. (2012) · Briefings in Bioinformatics · doi:10.1093/bib/bbr069 · Cited by 224
“Reingold [30], a force-directed method which gen-”
Igarashi, T., Takai, J., & Yoshida, T. (2005) · Journal of Social and Personal Relationships · doi:10.1177/0265407505056492 · Cited by 223
“We regarded intimacy symmetrized by the mean values of two actors as similarity, and then plotted the observed relations using the spring-embedding algorithm method (Fruchterman & Reingold, 1991) as shown in Figure 2.”
MethodVlasova, A., Capella-Gutiérrez, S., Rendón-Anaya, M., Hernández-Oñate, M., Minoche, A. E., Erb, I., Câmara, F., Prieto-Barja, P., Corvelo, A., Sanseverino, W., et al. (2016) · Genome Biology · doi:10.1186/s13059-016-0883-6 · Cited by 223
“The graph was drawn using the FruchtermanReingold layout [95].”
MethodA fast adaptive layout algorithm for undirected graphs
Frick, A., Mehldau, H., & Ludwig, A. (1994) · Repository KITopen (Karlsruhe Institute of Technology) · doi:10.5445/ir/268794 · Cited by 223
Musigmann, B., von der Gracht, H., & Hartmann, E. (2020) · IEEE Transactions on Engineering Management · doi:10.1109/tem.2020.2980733 · Cited by 222
“Based on Hjørland [149], papers that are more frequently cocited are more likely to present the same kind of research”
BackgroundWysocki, A., McCarthy, I., van Bork, R., Cramer, A. O. J., & Rhemtulla, M. (2025) · advances.in/psychology · doi:10.56296/aip00037 · Cited by 221
Network analysis of persistent complex bereavement disorder in conjugally bereaved adults.
Robinaugh, D. J., LeBlanc, N. J., Vuletich, H. A., & McNally, R. J. (2014) · Journal of Abnormal Psychology · doi:10.1037/abn0000002 · Cited by 219
“The position of the nodes within the network is based on an algorithm that places nodes with stronger associations in the center of the network and nodes with weaker associations on the periphery of the network (Fruchterman & Reingold, 1991).”
Phylogenetic analysis of AAA proteins
Frickey, T., & Lupas, A. N. (2004) · Journal of Structural Biology · doi:10.1016/j.jsb.2003.11.020 · Cited by 219
Mapping topics and topic bursts in PNAS
Mane, K. K., & Börner, K. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307626100 · Cited by 219
A survey of visualization tools for biological network analysis
Pavlopoulos, G. A., Wegener, A.-L., & Schneider, R. (2008) · BioData Mining · doi:10.1186/1756-0381-1-12 · Cited by 218
“Direct forcing and energy free layout algorithms [42], such as the Kimura-Kawai [43] and Fruchterman-Reingold [3] with free or fixed points are also included.”
Funkhouser, C. J., Chacko, A. A., Correa, K. A., Kaiser, A. J. E., & Shankman, S. A. (2021) · Journal of Child Psychology and Psychiatry · doi:10.1111/jcpp.13256 · Cited by 218
Discovery of Distinct Immune Phenotypes Using Machine Learning in Pulmonary Arterial Hypertension
Sweatt, A. J., Hedlin, H. K., Balasubramanian, V., Hsi, A., Blum, L. K., Robinson, W. H., Haddad, F., Hickey, P. M., Condliffe, R., Lawrie, A., et al. (2019) · Circulation Research · doi:10.1161/circresaha.118.313911 · Cited by 217
“3 (median 24% [21-28] vs 29% [25-34], p=0.”
Schwerdtfeger, P., Wirz, L. N., & Avery, J. (2015) · WIREs Computational Molecular Science · doi:10.1002/wcms.1207 · Cited by 215
Rossetto, D. E., Bernardes, R. C., Borini, F. M., & Gattaz, C. C. (2018) · Scientometrics · doi:10.1007/s11192-018-2709-7 · Cited by 214
“Beginning with a random positioning, a stable system can be created through interactions (Fruchterman and Reingold 1991) in which it positions the authors close to the co-cited authors.”
BackgroundExploring and Predicting Transferability across NLP Tasks
Vu, T., Wang, T., Munkhdalai, T., Sordoni, A., Trischler, A., Mattarella-Micke, A., Maji, S., & Iyyer, M. (2020) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.635 · Cited by 212
Barabino, E., Fioriti, D., Guerrazzi, E., Mariuzzo, I., Poli, D., Raugi, M., Razaei, E., Schito, E., & Thomopulos, D. (2023) · Sustainable Energy Grids and Networks · doi:10.1016/j.segan.2023.101187 · Cited by 213
A system for graph-based visualization of the evolution of software
Collberg, C., Kobourov, S., Nagra, J., Pitts, J., & Wampler, K. (2003) · Proceedings of the 2003 ACM symposium on Software visualization · doi:10.1145/774833.774844 · Cited by 209
“In the last level of the ltra tion a Fruchterman-Reingold calculation [ 12 ] for the force vector is used:”
MethodMAVisto: a tool for the exploration of network motifs
Schreiber, F., & Schwobbermeyer, H. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti556 · Cited by 209
Clickstream Data Yields High-Resolution Maps of Science
Bollen, J., Van de Sompel, H., Hagberg, A., Bettencourt, L., Chute, R., Rodriguez, M. A., & Balakireva, L. (2009) · PLoS ONE · doi:10.1371/journal.pone.0004803 · Cited by 208
Bright, J. (2018) · Journal of Computer-Mediated Communication · doi:10.1093/jcmc/zmx002 · Cited by 207
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.