Graph drawing by force‐directed placement

By Thomas M. J. Fruchterman, E. Reingold. 1991

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Exploring and Predicting Transferability across NLP Tasks (2020, methodology): “A.2 Fruchterman-Reingold force-directed placement algorithm The Fruchterman-Reingold force-directed placement algorithm (Fruchterman and Reingold, 1991) simulates a space of nodes (in our setup, tasks) as a system of atomic particles/celestial bodies, exerting attractive forces on one another.”
The analysis of social networks (2008, methodology): “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.”
Network analysis: an integrative approach to the structure of psychopathology. (2013, background): “…an algorithm that positions strongly connected nodes in the middle of the graph and the more weakly connected nodes in the periphery of the graph (Fruchterman & Reingold 1991): for example, according to the Dutch clinicians the symptom “depressed mood” is important in the disorder because it has…”
Gender differences in social network development via mobile phone text messages: A longitudinal study (2005, methodology): “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.”
Graph abstraction reconciles clustering with trajectory inference through a topology preserving map of single cells (2017, methodology): “This assumption is on one hand based on the community’s success with graph-based clustering [15, 17, 41], pseudotime inference [8], visualization [16, 23] and t-distributed stochastic neighborhood embedding [tSNE, 43, 44] — the latter can be seen as using a fully-connected graph with decaying weight”
Network analysis: a brief overview and tutorial (2018, methodology): “The most frequently used approach in psychological networks is the Fruchterman-Reingold algorithm (Fruchterman & Reingold, 1991), which calculates the optimal layout so that nodes with less strength and less connections are placed further apart, and those with more and/or stronger connections are…”
Metrics for Graph Drawing Aesthetics (2002, methodology): “* ITS (iterative constraint spring, grid based): based on the algorithm by Fruchterman and Reingold [10],”
Synergy Maps: exploring compound combinations using network-based visualization (2015, methodology): “A graph layout algorithm, such as circular [33] or force-directed [34] is usually employed to position nodes.”
Social Network Analysis with sna (2008, unknown): “Network visualization has been a fundamental aspect of social network analysis since its inception ( Freeman 2004 ), and this functionality is an important feature of sna.”
NetCoMi: network construction and comparison for microbiome data in R (2020, unknown): “Node positions are defined using the Fruchterman-Reingold algorithm [110].”
A survey of two-dimensional graph layout techniques for information visualisation (2013, methodology): “The first adaptation, which was for speed and simplicity, of the spring-embedder algorithm was by Fruchterman and Reingold.(26) This was subject to the properties of connected nodes appearing close to one another (but not too close), aiming for a layout which conformed to the principles of even node”
Intercity Relations and Globalisation: The Evolution of the Global Urban Hierarchy, 1981—2007 (2010, background): “While they differ in the particulars, all such algorithms attempt to find a solution that minimises the energy of the system (Eades, 1984; Fruchterman and Reingold, 1991).”
Network Visualization by Semantic Substrates (2006, methodology): “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].”
Systematic Functional Annotation and Visualization of Biological Networks (2016, methodology): “Create a new network map by applying a force-directed network layout algorithm (e.g., Kamada-Kawai (Kamada and Kawai, 1989) or Fruchterman-Reingold (Fruchterman and Reingold, 1991)) implemented as part of the MatlabBGL toolbox (Gleich, 2009).”