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 601–700 of 1,021
Cao, X., Wang, L., Cao, C., Fang, R., Chen, C., Hall, B. J., & Elhai, J. D. (2019) · Journal of Child Psychology and Psychiatry · doi:10.1111/jcpp.12963 · Cited by 76
Wittkop, T., Baumbach, J., Lobo, F. P., & Rahmann, S. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-396 · Cited by 84
“FORCE is motivated by a physically inspired force-based graph layout algorithm developed by Fruchterman and Reingold [13].”
MethodThe network structure of paranoia in the general population
Bell, V., & O’Driscoll, C. (2018) · Social Psychiatry and Psychiatric Epidemiology · doi:10.1007/s00127-018-1487-0 · Cited by 83
Complex systems: Features, similarity and connectivity
Comin, C. H., Peron, T., Silva, F. N., Amancio, D. R., Rodrigues, F. A., & Costa, L. D. F. (2020) · Physics Reports · doi:10.1016/j.physrep.2020.03.002 · Cited by 83
Empirical Comparison of Visualization Tools for Larger-Scale Network Analysis
Pavlopoulos, G. A., Páez-Espino, D., Kyrpides, N. C., & Iliopoulos, I. (2017) · Advances in Bioinformatics · doi:10.1155/2017/1278932 · Cited by 83
“, Fruchterman and Reingold [28], Kamada and Kawai [31]), hierarchical, multilevel, planar, and tree layout algorithms, most of them optimized and implemented within the Open Graph Drawing Framework (OGDF) [32].”
MethodNetwork of depression and anxiety symptoms in patients with epilepsy
Wei, Z., Ren, L., Wang, X., Liu, C., Cao, M., Mengmeng, H., Jiang, Z., Hui, B., Feng, X., Yang, Q., et al. (2021) · Epilepsy Research · doi:10.1016/j.eplepsyres.2021.106696 · Cited by 83
Kinetica: naturalistic multi-touch data visualization
Rzeszotarski, J. M., & Kittur, A. (2014) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/2556288.2557231 · Cited by 83
“Force-based graph layouts use attraction and repulsion, which people naturally intuit, to make graph exploration easier [11].”
BackgroundQuantifying the interdisciplinarity of scientific journals and fields
Silva, F. N., Rodrigues, F. A., Oliveira, O. N., & Costa, L. D. F. (2013) · Journal of Informetrics · doi:10.1016/j.joi.2013.01.007 · Cited by 83
How Do Investment Ideas Spread through Social Interaction? Evidence from a Ponzi Scheme
Rantala, V. (2019) · The Journal of Finance · doi:10.1111/jofi.12822 · Cited by 83
Martinus, K., Sigler, T., Searle, G., & Tonts, M. (2015) · Geoforum · doi:10.1016/j.geoforum.2015.06.006 · Cited by 83
Cluster stability and the use of noise in interpretation of clustering
Davidson, G. S., Wylie, B. N., & Boyack, K. W. (2005) · IEEE Symposium on Information Visualization, 2001. INFOVIS 2001. · doi:10.1109/infvis.2001.963275 · Cited by 75
Social Structure of Facebook NetworksPreprint
Traud, A. L., Mucha, P. J., & Porter, M. A. (2011) · SSRN Electronic Journal · doi:10.2139/ssrn.1470768 · Cited by 84
A network analysis approach to ADHD symptoms: More than the sum of its parts
Silk, T. J., Malpas, C. B., Beare, R., Efron, D., Anderson, V., Hazell, P., Jongeling, B., Nicholson, J. M., & Sciberras, E. (2019) · PLOS ONE · doi:10.1371/journal.pone.0211053 · Cited by 65
Inflammation Promotes a Conversion of Astrocytes into Neural Progenitor Cells via NF-κB Activation
Gabel, S., Koncina, E., Dorban, G., Heurtaux, T., Birck, C., Glaab, E., Michelucci, A., Heuschling, P., & Grandbarbe, L. (2016) · Molecular Neurobiology · doi:10.1007/s12035-015-9428-3 · Cited by 64
Understanding Twitter data with TweetXplorer
Morstatter, F., Kumar, S., Liu, H., & Maciejewski, R. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487703 · Cited by 82
Selecting the Most Influential Nodes in Social Networks
Estévez, P. A., Vera, P., & Saito, K. (2007) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2007.4371333 · Cited by 82
“1)Spring Embedder Method: Oneoftheearliest algorithms todrawgraphs wasproposed byEades[17] andwas later refined byFruchterman andReingold [ 18 ].”
MethodWolff, A. (2007) · Informatik - Forschung und Entwicklung · doi:10.1007/s00450-007-0036-y · Cited by 82
EXACT AND HEURISTIC ALGORITHMS FOR WEIGHTED CLUSTER EDITING
Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Truß, A., & Böcker, S. (2007) · IEEE Computational Systems Bioinformatics Conference (CSB) · doi:10.1142/9781860948732_0040 · Cited by 82
“(6) Solve the problem recursively for G1 and G2, as long as there is a chance for a better solution: If delcost ≥ cost , return (empty list, cost).”
BackgroundA Structural Measurement System for Engineering Design Processes
Kreimeyer, M. (2010) · mediaTUM (Technical University of Munich) · Cited by 82
The Atlas for the Aspiring Network ScientistPreprint
Coscia, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.00863 · Cited by 82
Spătaru, B., Podina, I. R., Tulbure, B. T., & Maricutoiu, L. P. (2024) · Stress and Health · doi:10.1002/smi.3450 · Cited by 81
Product Differentiation and Oligopoly: A Network Approach
Pellegrino, B. (2025) · American Economic Review · doi:10.1257/aer.20201425 · Cited by 81
BicOverlapper: A tool for bicluster visualization
Santamaría, R., Therón, R., & Quintales, L. A. M. (2008) · Bioinformatics · doi:10.1093/bioinformatics/btn076 · Cited by 81
“The nodes are positioned following a force-directed layout (Fruchterman and Reinhold, 1991).”
BackgroundVisualization of semantic metadata and ontologies
Mutton, P., & Golbeck, J. (2004) · IEEE Conference on Information Visualization (IV) · doi:10.1109/iv.2003.1217994 · Cited by 81
“Spring embedding [3,4] is one such graph drawing method that is suitable for application to our data.”
MethodScott, T. A., Thomas, C. W., & Reyes, J. M. M. (2018) · Journal of Public Administration Research and Theory · doi:10.1093/jopart/muy053 · Cited by 81
DeepDrawing: A Deep Learning Approach to Graph Drawing
Wang, Y., Jin, Z., Wang, Q., Cui, W., Ma, T., & Qu, H. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2019.2934798 · Cited by 82
“This kind of modelling is the start of all force-directed techniques and has inspired many follow-up algorithms, like the spring-embedder algo-rithm by Fruchterman and Reingold [25], the graph-embedder (GEM) algorithm [24], and the energy-based approaches [47,48,63,78].”
MethodGRIP: Graph dRawing with Intelligent Placement
Gajer, P., & Kobourov, S. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44541-2_21 · Cited by 81
Network segregation in a model of misinformation and fact-checking
Tambuscio, M., Oliveira, D. F. M., Ciampaglia, G. L., & Ruffo, G. (2018) · Journal of Computational Social Science · doi:10.1007/s42001-018-0018-9 · Cited by 48
“Node layout was computed using a force-directed algorithm [22].”
MethodZhou, Z., & Yao, H. (2020) · Microorganisms · doi:10.3390/microorganisms8020268 · Cited by 80
“7 using the interactive platform Gephi with the Fruchterman Reingold placement algorithm [42,43].”
MethodThe importance of blue and green landscape connectivity for biodiversity in urban ponds
Hyseni, C., Heino, J., Bini, L. M., Bjelke, U., & Johansson, F. (2021) · Basic and Applied Ecology · doi:10.1016/j.baae.2021.10.004 · Cited by 81
Bekris, F., Vasileiadis, S., Papadopoulou, E., Samaras, Α., Testempasis, S., Gkizi, D., Tavlaki, G. I., Tzima, A. K., Paplomatas, E. J., Markakis, E. A., et al. (2021) · Environmental Microbiome · doi:10.1186/s40793-021-00390-1 · Cited by 80
“The force-directed Fruchterman-Reingold layout [49] was used for plotting the final network.”
MethodViguerie, N., Montastier, É., Maoret, J.-J., Roussel, B., Combes, M., Valle, C., Vialaneix, N., Iacovoni, J. S., Martínez, J. A., Holst, C., et al. (2012) · PLoS Genetics · doi:10.1371/journal.pgen.1002959 · Cited by 80
“org) with the Fruchterman Reingold algorithm [54].”
The geometry of security: Modeling interstate alliances as evolving networks
Warren, T. C. (2010) · Journal of Peace Research · doi:10.1177/0022343310386270 · Cited by 80
“The nodes are arrayed using a force-directed layout algorithm (Kamada and Kawai 1989; Fruchterman and Reingold 1991), which automatically reveals clusters of nodes with similar patterns of ties.”
MethodConnectomeExplorer: Query-Guided Visual Analysis of Large Volumetric Neuroscience Data
Beyer, J., Al-Awami, A. K., Kasthuri, N., Lichtman, J. W., Pfister, H., & Hadwiger, M. (2013) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2013.142 · Cited by 80
Animated Visualization of Software History using Evolution Storyboards
Beyer, D., & Hassan, A. E. (2006) · Working Conference on Reverse Engineering (WCRE) · doi:10.1109/wcre.2006.14 · Cited by 80
DD-HDS: A Method for Visualization and Exploration of High-Dimensional Data
Lespinats, S., Verleysen, M., Giron, A., & Fertil, B. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2007.891682 · Cited by 80
“In the second case, tears are allowed, with the risk that neighbor points in the original space may be found widely separated in the output space; tears are sometimes necessary, but may lead to wrong interpretations of neighborhoods in the output space.”
BackgroundMethodInfluentialStructure and dynamics of stock market in times of crisis
Zhao, L., Li, W., & Cai, X. (2015) · Physics Letters A · doi:10.1016/j.physleta.2015.11.015 · Cited by 80
An Interactive Visual Analytics Platform for Smart Intelligent Transportation Systems Management
Kalamaras, I., Zamichos, A., Salamanis, A. I., Drosou, A., Kehagias, D. D., Margaritis, G., Papadopoulos, S., & Tzovaras, D. K. (2017) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2017.2727143 · Cited by 80
“a low dimensional space, in an intuitive and visually pleasing way [23].”
BackgroundLearning to Segment 3D Point Clouds in 2D Image Space
Lyu, Y., Huang, X., & Zhang, Z. (2020) · IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings - IEEE Computer Society Conference on Computer Vision and Pattern Recognition/Proceedings · doi:10.1109/cvpr42600.2020.01227 · Cited by 80
Performance of Layout Algorithms: Comprehension, not Computation
Purchase, H. C. (1998) · Journal of Visual Languages & Computing · doi:10.1006/jvlc.1998.0093 · Cited by 80
“FD-FR: This force directed algorithm by Fruchterman and Reingold [13] is based on the original idea by Eades [14].”
Methodde Haan, A., Landolt, M. A., Fried, E. I., Kleinke, K., Alisic, E., Bryant, R. A., Salmon, K., Chen, S., Liu, S., Dalgleish, T., et al. (2019) · Journal of Child Psychology and Psychiatry · doi:10.1111/jcpp.13101 · Cited by 79
Castellanos, N., Diez, G. G., Antúnez-Almagro, C., Bailén, M., Bressa, C., González Soltero, R., Pérez, M., & Larrosa, M. (2020) · Frontiers in Microbiology · doi:10.3389/fmicb.2019.03142 · Cited by 69
graph4lg: A package for constructing and analysing graphs for landscape genetics in R
Savary, P., Foltête, J., Moal, H., Vuidel, G., & Garnier, S. (2020) · Methods in Ecology and Evolution · doi:10.1111/2041-210x.13530 · Cited by 79
“It maps graphs in a spatially explicit way or implements an attraction–repulsion algorithm based on link weights (Fruchterman & Reingold, 1991) to assess whether nodes cluster together independently from their spatial locations.”
MethodGenome-Wide Analysis of Repeat Diversity across the Family Musaceae
Novák, P., Hřibová, E., Neumann, P., Koblížková, A., Doležel, J., & Macas, J. (2014) · PLoS ONE · doi:10.1371/journal.pone.0098918 · Cited by 79
“Graph layout was calculated using the 3D version of the Fruchterman and Reingold algorithm [55] from which a 2D projection is shown.”
MethodFernandez, M., Riveros, J., Campos, M., Mathee, K., & Narasimhan, G. (2015) · BMC Genomics · doi:10.1186/1471-2164-16-s11-s6 · Cited by 79
Wilt, J. A., Cooper, E. B., Grubbs, J. B., Exline, J. J., & Pargament, K. I. (2016) · Sexual Addiction & Compulsivity · doi:10.1080/10720162.2016.1140604 · Cited by 65
Representation Learning for Natural Language Processing
Liu, Z., Lin, Y., & Sun, M. (2023) · Springer eBooks · doi:10.1007/978-981-99-1600-9 · Cited by 80
Extraction and Analysis of Facebook Friendship Relations
Catanese, S., Meo, P. D., Ferrara, E., Fiumara, G., & Provetti, A. (2012) · Springer eBooks · doi:10.1007/978-1-4471-4054-2_12 · Cited by 78
AutoVis: Automatic Visualization
Wills, G. J., & Wilkinson, L. (2008) · Information Visualization · doi:10.1057/ivs.2008.27 · Cited by 78
Aiello, C. M., Nussear, K. E., Walde, A. D., Esque, T. C., Emblidge, P., Sah, P., Bansal, S., & Hudson, P. J. (2014) · Animal Conservation · doi:10.1111/acv.12147 · Cited by 78
Favaretto, J. E. R., & Francisco, E. D. R. (2017) · Revista de Administração de Empresas · doi:10.1590/s0034-759020170407 · Cited by 78
Abramson, C. M., Joslyn, J., Rendle, K. A. S., Garrett, S. B., & Dohan, D. P. (2017) · Ethnography · doi:10.1177/1466138117725340 · Cited by 78
“The graph is laid out using the Fruchterman–Reingold method, which spatially positions nodes based on the number of shared ties between them (see Fruchterman and Reingold (1991) for a technical discussion).”
MethodVisual Detection of Structural Changes in Time-Varying Graphs Using Persistent Homology
Hajij, M., Wang, B., Scheidegger, C., & Rosen, P. (2018) · IEEE Pacific Visualization Symposium · doi:10.1109/pacificvis.2018.00024 · Cited by 78
“…diagrams is Tutte’s barycentric coordinate embedding [49], followed by linear programming techniques [31], force-directed/mass-spring embeddings [28, 36], embeddings of the graph metric [30], and linear-algebraic properties of the connectivity structures (especially, the graph Laplacian and…”
BackgroundMarees, A. T., Smit, D. J. A., Abdellaoui, A., Nivard, M. G., van den Brink, W., Denys, D., Galama, T. J., Verweij, K. J. H., & Derks, E. M. (2021) · Nature Human Behaviour · doi:10.1038/s41562-021-01053-4 · Cited by 70
SBW - A Modular Framework for Systems Biology
Bergmann, F., & Sauro, H. M. (2006) · Winter Simulation Conference · doi:10.1109/wsc.2006.322938 · Cited by 78
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
Gajer, P., Goodrich, M. T., & Kobourov, S. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44541-2_20 · Cited by 78
Improving interactive retrieval by combining ranked lists and clustering
Leuski, A., & Allan, J. (2000) · RIAO Conference · Cited by 78
Nonparametric Bayes Modeling of Populations of Networks
Durante, D., Dunson, D. B., & Vogelstein, J. T. (2020) · DukeSpace (Duke University) · doi:10.6084/m9.figshare.3779019.v2 · Cited by 77
Hoffart, A., Johnson, S. U., & Ebrahimi, O. V. (2021) · Journal of Affective Disorders · doi:10.1016/j.jad.2021.07.019 · Cited by 77
Social comparison effects on academic self-concepts—Which peers matter most?
Jansen, M., Boda, Z., & Lorenz, G. (2022) · Developmental Psychology · doi:10.1037/dev0001368 · Cited by 78
Pislyakov, V. V., & Shukshina, E. (2014) · Journal of the Association for Information Science and Technology · doi:10.1002/asi.23093 · Cited by 78
“The Fruchterman-Reingold (Fruchterman & Reingold, 1991) energizing algorithm was implemented.”
MethodMental Health, Deprivation, and the Neighborhood Social Environment: A Network Analysis
McElroy, E., McIntyre, J. C., Bentall, R. P., Wilson, T. J., Holt, K., Kullu, C., Nathan, R., Kerr, A., Panagaki, K., McKeown, M., et al. (2019) · Clinical Psychological Science · doi:10.1177/2167702619830640 · Cited by 78
Regional industrial symbiosis: A review based on social network analysis
Vahidzadeh, R., Bertanza, G., Sbaffoni, S., & Vaccari, M. (2020) · Journal of Cleaner Production · doi:10.1016/j.jclepro.2020.124054 · Cited by 77
Fast interactive 3-D graph visualization
Bruß, I., & Frick, A. (1996) · Lecture notes in computer science · doi:10.1007/bfb0021794 · Cited by 77
“The idea of drawing arbitrary undirected graphs in 3-D seems to have first appeared in [7].”
BackgroundMethodResultInfluentialvon Klipstein, L., Borsboom, D., & Arntz, A. R. (2021) · PLoS ONE · doi:10.1371/journal.pone.0254496 · Cited by 76
Balcılar, M., Elsayed, A. H., & Hammoudeh, S. M. (2022) · Journal of International Financial Markets Institutions and Money · doi:10.1016/j.intfin.2022.101656 · Cited by 76
“The graph layout is generated using the Fruchterman-Reingold algorithm (Fruchterman and Reingold, 1991).”
MethodYang, M., Wei, W., Ren, L., Pu, Z., Zhang, Y., Li, Y., Li, X., & Wu, S. (2023) · BMC Public Health · doi:10.1186/s12889-023-17435-4 · Cited by 78
“The layout of the presented networks was based on the Fruchterman-Reingold algorithm [58].”
MethodSnazer: the simulations and networks analyzer
Mazza, T., Iaccarino, G., & Priami, C. (2010) · BMC Systems Biology · doi:10.1186/1752-0509-4-1 · Cited by 76
“It mainly employs the Fruchterman-Rheingold [27] layout algorithm for 2D and 3D graph positioning and display and makes use of a heavily optimized C-based Markov Clustering algo-rithm for graph clustering.”
MethodRapid Graph Layout Using Space Filling Curves
Muelder, C., & Ma, K. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.158 · Cited by 76
“The Grid-Variant Algorithm (GVA) [14], shown in Figure 8(b), is a heuristically accelerated layout based on the Fruchterman-Reingold layout algorithm [ 10 ].”
BackgroundMethodInfluentialIwashyna, T. J., Christie, J. D., Kahn, J. M., & Asch, D. A. (2009) · Chest · doi:10.1378/chest.08-1052 · Cited by 75
Spring algorithms and symmetry
Eades, P., & Lin, X. (2000) · Theoretical Computer Science · doi:10.1016/s0304-3975(99)00239-x · Cited by 76
“A number of spring algorithms ([2, 3, 6, 8, 12, 23]) have been developed.”
BackgroundMethodInfluentialStructure estimation for mixed graphical models in high-dimensional data
Haslbeck, J. M. B., & Waldorp, L. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1510.05677 · Cited by 47
“For the layout in Figure 4, we used the force-directed algorithm of Fruchterman and Reingold (1991), that places nodes with many edges close to the center of the layout.”
MethodHug, F., Avrillon, S., Sarcher, A., Vecchio, A. D., & Farina, D. (2022) · The Journal of Physiology · doi:10.1113/jp283040 · Cited by 76
“3C) (Fruchterman & Reingold, 1991).”
BackgroundInfluentialOchnik, D., Buława, B., Nagel, P., Gachowski, M., & Budziński, M. (2024) · Scientific Reports · doi:10.1038/s41598-024-76813-z · Cited by 76
“The layout of node positions was computed with the Fruchterman Reingold algorithm, which places nodes such that all the edges are of more or less equal length and there are as few crossing edges as possible 102 .”
Schryver, M. D., Vindevogel, S., Rasmussen, A., & Cramer, A. O. J. (2015) · Frontiers in Psychology · doi:10.3389/fpsyg.2015.01896 · Cited by 75
“The nodes most strongly correlated with other nodes can be placed most central in the network (Fruchterman and Reingold, 1991; Schmittmann et al., 2013).”
Bartels, L., Berliner, L., Holt, T., Jensen, T., Jungbluth, N., Plener, P., Risch, E., Rojas, R., Rosner, R., & Sachser, C. (2019) · Journal of Child Psychology and Psychiatry · doi:10.1111/jcpp.13009 · Cited by 69
A simple and unified method for drawing graphs: Magnetic-spring algorithm
Sugiyama, K., & Misue, K. (1995) · Lecture notes in computer science · doi:10.1007/3-540-58950-3_391 · Cited by 75
CoryneRegNet 4.0 – A reference database for corynebacterial gene regulatory networks
Baumbach, J. (2007) · BMC Bioinformatics · doi:10.1186/1471-2105-8-429 · Cited by 66
“The main idea is based on a force-based graph layouting algorithm, initially introduced by Fruchterman and Reingold [ 33 ].”
MethodTussyadiah, I. P., & Zach, F. (2015) · SSRN Electronic Journal · doi:10.2139/ssrn.2594985 · Cited by 75
Relatedness, complexity and local growth
Davies, B. I., & Maré, D. C. (2020) · Regional Studies · doi:10.1080/00343404.2020.1802418 · Cited by 74
Barbier, S., Huang, F., Andréani, M., Tao, R., Hao, J., Eleish, A. M., Prabhu, A., Minhas, O., Fontaine, K. S., Fox, P., et al. (2020) · Frontiers in Earth Science · doi:10.3389/feart.2020.00209 · Cited by 74
“The Fruchterman–Reingold force-directed graph algorithm (Fruchterman and Reingold, 1991) simulates attractive and repulsive forces between the nodes, similar to those of molecular or planetary simulations, while attempting to find a minimum energy state for the network layout.”
BackgroundKortemeyer, G., Nöhl, J., & Onishchuk, D. (2024) · Physical Review Physics Education Research · doi:10.1103/physrevphyseducres.20.020144 · Cited by 74
“Figure 13 shows a Fruchterman-Reingold [50, 51] representation of the Spearman-correlation matrix between the rubric items in Table I for Problem 1, resulting from Workflow 1 (WF1) in Table II.”
BackgroundMethodAnalyzing and Visualizing Criminal Network Dynamics: A Case Study
Xu, J., Marshall, B. B., Kaza, S., & Chen, H. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-25952-7_27 · Cited by 74
Probabilistic Latent Document Network Embedding
Le, T. M. V., & Lauw, H. W. (2014) · 2014 IEEE International Conference on Data Mining · doi:10.1109/icdm.2014.119 · Cited by 62
Which Policy First? A Network-Centric Approach for the Analysis and Ranking of Policy Measures
Taeihagh, A., Givoni, M., & Bañares‐Alcántara, R. (2013) · Environment and Planning B Planning and Design · doi:10.1068/b38058 · Cited by 74
Mele, T. V., & Block, P. (2014) · Computer-Aided Design · doi:10.1016/j.cad.2014.04.004 · Cited by 74
“9 is a drawing generated with an iterative implementation (Listing 1) of the Fruchterman–Reingold algorithm [34] available through NetworkX, a Python package for working with graphs [35], in combination with the crossing-edge check discussed above.”
MethodD-Dupe: An Interactive Tool for Entity Resolution in Social Networks
Bilgic, M., Licamele, L., Getoor, L. C., & Shneiderman, B. (2006) · Lecture notes in computer science · doi:10.1007/11618058_46 · Cited by 74
A multilevel society of herring-eating killer whales indicates adaptation to prey characteristics
Tavares, S. B., Samarra, F. I. P., & Miller, P. J. O. (2016) · Behavioral Ecology · doi:10.1093/beheco/arw179 · Cited by 74
Birkeland, M. S., & Heir, T. (2017) · European Journal of Psychotraumatology · doi:10.1080/20008198.2017.1333387 · Cited by 74
“The network structure is visualized by using the Fruchterman–Reingold algorithm (Fruchterman & Reingold, 1991), which places nodes with stronger and/ or more connections closer together, and nodes with weaker connections are placed more peripherally in the network (Epskampet al., 2012).”
MethodRoss, J., Murphy, D., & Armour, C. (2018) · Journal of Anxiety Disorders · doi:10.1016/j.janxdis.2018.05.007 · Cited by 67
“The network was visualized using the Fruchterman-Reingold algorithm (Fruchterman and, Reingold, 1991) in R package qgraph , version 1.4.4 (Epskamp, Cramer, Waldorp, Schmittmann, & Borsboom, 2012).”
InfluentialA Deep Generative Model for Graph Layout
Kwon, O.-H., & Ma, K. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2019.2934396 · Cited by 75
“In this paper, we focus on two-dimensional layout methods that produce straight-edge drawings, such as force-directed methods [17,23,25,27,50], dimensionality reduction-based methods [10,42,59], spectral methods [14,58], and multi-level methods [26,29,38,41,44,81].”
MethodThe search for meaningful work: A network analysis of personality and the job characteristics model
Simonet, D. V., & Castille, C. M. (2019) · Personality and Individual Differences · doi:10.1016/j.paid.2019.109569 · Cited by 74
Algorithms for Cluster Busting in Anchored Graph Drawing
Lyons, K. A., Meijer, H., & Rappaport, D. D. (1998) · Journal of Graph Algorithms and Applications · doi:10.7155/jgaa.00004 · Cited by 74
The diffusion of scientific innovations: A role typology
Herfeld, C. S., & Doehne, M. (2018) · Studies in History and Philosophy of Science Part A · doi:10.1016/j.shpsa.2017.12.001 · Cited by 73
Quantum Computer Systems: Research for Noisy Intermediate-Scale Quantum Computers
Ding, Y., & Chong, F. T. (2020) · Synthesis lectures on computer architecture · doi:10.2200/s01014ed1v01y202005cac051 · Cited by 73
Understanding the cascading failures in Indian power grids with complex networks theory
Zhang, G., Li, Z., Zhang, B., & Halang, W. A. (2013) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2013.03.003 · Cited by 73
Leisso, R. S., Buchanan, D. A., Lee, J., Mattheis, J. P., Sater, C., Hanrahan, I., Watkins, C. B., Gapper, N. E., Johnston, J. W., Schaffer, R. J., et al. (2014) · Physiologia Plantarum · doi:10.1111/ppl.12244 · Cited by 73
“The force directed layout algorithm (Fruchterman and Reingold 1991) was employed to visualize the network and identify areas of Physiol.”
MethodExploration of Networks using overview+detail with Constraint-based cooperative layout
Dwyer, T., Marriott, K., Schreiber, F., Stuckey, P. J., Woodward, M., & Wybrow, M. (2008) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2008.130 · Cited by 73
“Unlike the stress function, nodes i and j that are more than their ideal distance d ij apart are not penalized, thus eliminating long range attraction which can cause problems in highly constrained problems (see Fig. 2). In this regard P-stress has more in common with a Fruchterman-Reingold force model [ 18 ] than the…”
MethodStrategic Self-presentation in the Sharing Economy: Implications for Host Branding
Tussyadiah, I. P. (2016) · Springer eBooks · doi:10.1007/978-3-319-28231-2_50 · Cited by 73
Patient healthcare trajectory. An essential monitoring tool: a systematic review
Pinaire, J., Azé, J., Bringay, S., & Landais, P. (2017) · Health Information Science and Systems · doi:10.1007/s13755-017-0020-2 · Cited by 73
“For each corpus, we selected the tree representation described in [15] and in the algorithm in [16], to describe communities via the shortest path, thus highlighting the most frequently associated words in the same sentence or text.”
Method
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.