A multi-scale algorithm for drawing graphs nicely
From MaRDI portal
Recommendations
Cites work
- An algorithm for drawing general undirected graphs
- How to Draw a Graph
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 49719 (Why is no real title available?)
- scientific article; zbMATH DE number 2080098 (Why is no real title available?)
- Multilevel computations of integral transforms and particle interactions with oscillatory kernels
Cited in
(22)- An improved force-directed graph layout algorithm based on aesthetic criteria
- A multi-dimensional approach to force-directed layouts of large graphs
- Multi-level graph drawing using infomap clustering
- A million edge drawing for a fistful of dollars
- A distributed multilevel force-directed algorithm
- Reinforcing the spring algorithms: the Taguchi approach
- Relaxation-based coarsening and multiscale graph organization
- Efficient calculation of aestheticy metrics of a graph
- scientific article; zbMATH DE number 558540 (Why is no real title available?)
- A Fast Multi-Scale Method for Drawing Large Graphs
- Drawing Huge Graphs by Algebraic Multigrid Optimization
- scientific article; zbMATH DE number 2080098 (Why is no real title available?)
- Graph Drawing via Gradient Descent, (GD)^2
- The Turing Test for Graph Drawing Algorithms
- Graph Drawing
- Graph Drawing
- Drawing graphs with large vertices and thick edges.
- Spherical graph drawing by multi-dimensional scaling
- An annotated review on graph drawing and its applications
- Visualizing large graphs
- Graph spring neural ODEs for link sign prediction
- Drawing power law graphs using a local/global decomposition
This page was built for publication: A multi-scale algorithm for drawing graphs nicely
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948958)
