A Multilevel Algorithm for Force-Directed Graph Drawing
By Chris Walshaw. 2000
396 citations recorded by the source corpus.
Subfields: Computer Graphics and Computer-Aided Design, Computer Vision and Pattern Recognition
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Graphics and Computer-Aided Design
- Michael Jünger
- Steven S. Skiena
- Stefan Hachul
- Bryan Perozzi
- Haochen Chen
- Yifan Hu
- Stephen G. Kobourov
In Computer Vision and Pattern Recognition
- Stephen G. Kobourov
- Yifan Hu
- Tommaso Venturini
- Steven S. Skiena
- Mathieu Jacomy
- Sebastien Heymann
- Mathieu Bastian
- Michael Jünger
Citations in the corpus
- ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software (2014, background): “Graph coarsening [7,9] cannot be implemented for the same reason.”
- HARP: Hierarchical Representation Learning for Networks (2017, methodology): “Multilevel layout algorithms are popular methods in the graph drawing community, where a hierarchy of approximations is used to solve the original layout problem [6, 9, 21].”
- Graph Drawing by Stress Majorization (2004, background): “In fact, the 516 graph is an elongated mesh (see [18] for its layout) and should be easily drawn without smart initialization.”
- Spring Embedders and Force Directed Graph Drawing Algorithms (2012, methodology): “These structures can be coarser graphs (as in the approach of Hadany and Harel [37], Harel and Koren [38], and Walshaw [67], or vertex filtrations as in the approach of Gajer et al. [31].”
- Energy Models for Graph Clustering (2007, neutral): “Efficient multi-scale algorithms for energy-based graph layout have been developed by Gajer et al. [21], Harel and Koren [27], Walshaw [51], and Hachul and J¨unger [24].”
- Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm (2004, methodology): “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].”
- Efficient, High-Quality Force-Directed Graph Drawing (2006, methodology): “Our numerical results show that the algorithm is comparable in speed to Walshaw’s [2] highly efficient multilevel graph drawing algorithm, yet gives better results on some of the difficult problems.”