An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
GD '95 Proceedings of the Symposium on Graph Drawing
JIGGLE: Java Interactive Graph Layout Environment
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Fast Multi-scale Method for Drawing Large Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
GRIP: Graph dRawing with Intelligent Placement
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
FADE: Graph Drawing, Clustering, and Visual Abstraction
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Multilevel Algorithm for Force-Directed Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components
IEEE Transactions on Visualization and Computer Graphics
TopoLayout: Multilevel Graph Layout by Topological Features
IEEE Transactions on Visualization and Computer Graphics
Multi-Level Graph Layout on the GPU
IEEE Transactions on Visualization and Computer Graphics
Rapid Multipole Graph Drawing on the GPU
Graph Drawing
An Experimental Study on Distance-Based Graph Drawing
Graph Drawing
Improved efficiency of spring embedders: taking advantage of GPU programming
VIIP '07 The Seventh IASTED International Conference on Visualization, Imaging and Image Processing
Eigensolver methods for progressive multidimensional scaling of large data
GD'06 Proceedings of the 14th international conference on Graph drawing
Algorithms and theory of computation handbook
A scalable multi-scale framework for parallel simulation and visualization of microbial evolution
Proceedings of the 2011 TeraGrid Conference: Extreme Digital Discovery
TVi: a visual querying system for network monitoring and anomaly detection
Proceedings of the 8th International Symposium on Visualization for Cyber Security
Control and visualization system for managed self-organization network
Proceedings of the 7th International Conference on Network and Services Management
Manual clustering refinement using interaction with blobs
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
A scalable parallel force-directed graph layout algorithm
EG PGV'08 Proceedings of the 8th Eurographics conference on Parallel Graphics and Visualization
An aggregation-based approach to quality evaluation of graph drawings
Proceedings of the 5th International Symposium on Visual Information Communication and Interaction
Centrality based visualization of small world graphs
EuroVis'08 Proceedings of the 10th Joint Eurographics / IEEE - VGTC conference on Visualization
Scalable, versatile and simple constrained graph layout
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
GD'12 Proceedings of the 20th international conference on Graph Drawing
Clustering, visualizing, and navigating for large dynamic graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Improving multiple aesthetics produces better graph drawings
Journal of Visual Languages and Computing
| Hi-index | 0.00 |
In the last decade several algorithms that generate straight-line drawings of general large graphs have been invented. In this paper we investigate some of these methods that are based on force-directed or algebraic approaches in terms of running time and drawing quality on a big variety of artificial and real-world graphs. Our experiments indicate that there exist significant differences in drawing qualities and running times depending on the classes of tested graphs and algorithms.