A Heuristic for Graph Drawing

By P. Eades. 1984

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

ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software (2014, background): “Note that actually, non-realistic forces have been used since the beginning, noticeably by Eades [16] in his pioneer algorithm.”
Cytoscape: a software environment for integrated models of biomolecular interaction networks. (2003, positive): “Nodes and edges may be selected according to a wide variety of criteria, including selection by name, by a list of names, layout algorithms (hierarchical and circular) are implemented using the yFiles Graph Library (www.yworks.de).”
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].”
ForceAtlas 2 , A Continuous Graph Layout Algorithm for Handy Network Visualization (2012, methodology): “The “spring-electric” layout [10] is a simulation inspired by real life.”
A Fast Adaptive Layout Algorithm for Undirected Graphs (1994, methodology): “Independently, Fruchterman and Reingold [6] modified Eades' algorithm by introducing a simple cooling schedule.”
Using social network analysis tools in ecology: Markov process transition models applied to the seasonal trophic network dynamics of the Chesapeake Bay. (2009, methodology): “Here we used NETDRAW’s spring-embedding algorithm Eades (1984).”
Statistical strategies for avoiding false discoveries in metabolomics and related experiments (2007, methodology): “Its application to graph drawing was noted by Kruskal and Seery (1980), and has since been used by many others (e.g., Eades, 1984; Ebbels et al., 2006; Fruchterman and Reingold, 1991; Kim et al., 2001)).”
Mining communities and their relationships in blogs: A study of online hate groups (2007, methodology): “A type of graph layout algorithm called spring embedder, also known as force-directed method (Davidson and Harel, 1996; Eades, 1984; Fruchterman and Reingold, 1991; Kamada and Kawai, 1989) has been widely used to visualize networks.”
Energy Models for Graph Clustering (2007, unknown): “In many force and energy models, including those of Eades [16] and Fruchterman and Reingold [20], adjacent nodes attract and all pairs of nodes repulse.”
Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm (2004, background): “In practice, classical forcedirected algorithms like [5, 12, 6, 4] are not well suited for drawing large graphs containing many thousands of vertices, since their worst case running time is at least quadratic.”
Graph Visualization and Navigation in Information Visualization: A Survey (2000, background): “Eades[33] was the first to propose this approach in graph drawing, modelling nodes and edges of a graph as physical bodies tied with springs.”
A Multilevel Algorithm for Force-Directed Graph Drawing (2000, methodology): “The original concept came from a paper by Eades, [5], and is constructed around the idea of replacing vertices by rings or hinges and edges by springs.”
Graph drawing by force‐directed placement (1991, methodology): “We present a modification of the spring-embedder model of Eades [ Congresses Numerantium, 42, 149–160, (1984)] for drawing undirected graphs with straight edges.”
ROSETTA Technical Reference Manual (2001, background): “Signature: DecisionTable→ DecisionTable 3Algorithms for generating visually pleasing graph layouts exist that operate by constructing a virtual physical model and running an iterative solver to find a low-energy configuration [14, 21, 15].”