Drawing large graphs with a potential-field-based multilevel algorithm
From MaRDI portal
Recommendations
Cited in
(51)- A force-directed algorithm for drawing directed graphs symmetrically
- Aesthetic discrimination of graph layouts
- Faster force-directed graph drawing with the well-separated pair decomposition
- A multi-dimensional approach to force-directed layouts of large graphs
- A quality metric for visualization of clusters in graphs
- Multi-level graph drawing using infomap clustering
- Node overlap removal algorithms: a comparative study
- Emanation graph: a plane geometric spanner with Steiner points
- Drawing large graphs by multilevel maxent-stress optimization
- A million edge drawing for a fistful of dollars
- A distributed multilevel force-directed algorithm
- A sparse stress model
- Placing arrows in directed graph drawings
- An experimental study on the ply number of straight-line drawings
- An effective crossing minimisation heuristic based on star insertion
- Simplified emanation graphs: a sparse plane spanner with Steiner points
- Rapid Multipole Graph Drawing on the GPU
- The Binary Stress Model for Graph Drawing
- A fast successive over-relaxation algorithm for force-directed network graph drawing
- Graph drawing by high-dimensional embedding
- Drawing Huge Graphs by Algebraic Multigrid Optimization
- scientific article; zbMATH DE number 2069509 (Why is no real title available?)
- A multilevel algorithm for force-directed graph drawing
- A fast multi-scale method for drawing large graphs
- FADE: Graph drawing, clustering, and visual abstraction
- A multi-dimensional approach to force-directed layouts of large graphs
- GRIP: Graph drawing with intelligent placement
- An experimental study on the ply number of straight-line drawings
- An Interactive Tool to Explore and Improve the Ply Number of Drawings
- Drawing Big Graphs Using Spectral Sparsification
- Drawing dynamic graphs without timeslices
- A Multilevel Algorithm for Force-Directed Graph-Drawing
- Force-directed graph drawing using social gravity and scaling
- Crossing Layout in Non-planar Graph Drawings
- Node overlap removal algorithms: an extended comparative study
- Aesthetic Discrimination of Graph Layouts
- Large-Graph Layout Algorithms at Work: An Experimental Study
- An efficient implementation of Sugiyama's algorithm for layered graph drawing
- Generalizing geometric graphs
- Graph Drawing
- Graph Drawing
- FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing
- Shape-faithful graph drawings
- Visualizing evolving trees
- Visualizing large graphs
- Graph-drawing supported identification of influential students at schools (poster abstract)
- On the external validity of average-case analyses of graph algorithms
- Winning the DG challenge for the 4th time: our approach (graph drawing contest abstract)
- Complex systems: features, similarity and connectivity
- Drawing power law graphs using a local/global decomposition
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis
This page was built for publication: Drawing large graphs with a potential-field-based multilevel algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711614)
