A Fast Multi-Scale Method for Drawing Large Graphs
From MaRDI portal
Publication:4405597
Recommendations
Cited in
(25)- Efficient Node Overlap Removal Using a Proximity Stress Model
- Complex systems: features, similarity and connectivity
- Faster force-directed graph drawing with the well-separated pair decomposition
- Drawing Huge Graphs by Algebraic Multigrid Optimization
- An annotated review on graph drawing and its applications
- Drawing Big Graphs Using Spectral Sparsification
- A million edge drawing for a fistful of dollars
- A distributed multilevel force-directed algorithm
- Graph reduction with spectral and cut guarantees
- Who's who in global value chains? A weighted network approach
- Multi-level graph drawing using infomap clustering
- Visualizing large graphs
- The Turing Test for Graph Drawing Algorithms
- Faster Force-Directed Graph Drawing with the Well-Separated Pair Decomposition
- Fast edge-routing for large graphs
- A multi-scale algorithm for drawing graphs nicely
- From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
- A multi-dimensional approach to force-directed layouts of large graphs
- Drawing large graphs by multilevel maxent-stress optimization
- An improved force-directed graph layout algorithm based on aesthetic criteria
- A Multilevel Algorithm for Force-Directed Graph-Drawing
- scientific article; zbMATH DE number 2080098 (Why is no real title available?)
- scientific article; zbMATH DE number 2080100 (Why is no real title available?)
- Graph Drawing
- scientific article; zbMATH DE number 2080097 (Why is no real title available?)
This page was built for publication: A Fast Multi-Scale Method for Drawing Large Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4405597)