Large-Graph Layout Algorithms at Work: An Experimental Study
From MaRDI portal
Recommendations
Cited in
(19)- Faster force-directed graph drawing with the well-separated pair decomposition
- An experimental evaluation of multilevel layout methods
- A distributed multilevel force-directed algorithm
- GraphMaps: browsing large graphs as interactive maps
- Reinforcing the spring algorithms: the Taguchi approach
- scientific article; zbMATH DE number 1858605 (Why is no real title available?)
- Connected-closeness: A Visual Quantification of Distances in Network Layouts
- An experimental study on the ply number of straight-line drawings
- scientific article; zbMATH DE number 7286697 (Why is no real title available?)
- Graph Drawing
- An experimental study on the ply number of straight-line drawings
- PLANET: a radial layout algorithm for network visualization
- Fast layout computation of clustered networks: algorithmic advances and experimental analysis
- scientific article; zbMATH DE number 1670640 (Why is no real title available?)
- Drawing directed acyclic graphs: an experimental study
- An experimental comparison of four graph drawing algorithms.
- Shape-based quality metrics for large graph visualization
- Graph Drawing
- Hybrid layout algorithm based on skeleton subgraph
This page was built for publication: Large-Graph Layout Algorithms at Work: An Experimental Study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301419)