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)
Distribution-Independent Hierarchical Algorithmsfor the N-body Problem
The Journal of Supercomputing
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
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
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
The rapid evaluation of potential fields in particle systems
The rapid evaluation of potential fields in particle systems
Visual Exploration of Complex Time-Varying Graphs
IEEE Transactions on Visualization and Computer Graphics
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
MOVIS: A system for visualizing distributed mobile object environments
Journal of Visual Languages and Computing
Process and Pitfalls in Writing Information Visualization Research Papers
Information Visualization
The Binary Stress Model for Graph Drawing
Graph Drawing
Structural differences between two graphs through hierarchies
Proceedings of Graphics Interface 2009
Drawing graphs with nonuniform nodes using potential fields
Journal of Visual Languages and Computing
Improved efficiency of spring embedders: taking advantage of GPU programming
VIIP '07 The Seventh IASTED International Conference on Visualization, Imaging and Image Processing
GD'06 Proceedings of the 14th international conference on Graph drawing
An experimental evaluation of multilevel layout methods
GD'10 Proceedings of the 18th international conference on Graph drawing
Topology-driven force-directed algorithms
GD'10 Proceedings of the 18th international conference on Graph drawing
The university of Florida sparse matrix collection
ACM Transactions on Mathematical Software (TOMS)
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Energy-based clustering of graphs with nonuniform degrees
GD'05 Proceedings of the 13th international conference on Graph Drawing
A new force-directed graph drawing method based on edge-edge repulsion
Journal of Visual Languages and Computing
GD'11 Proceedings of the 19th international conference on Graph Drawing
Drawing Large Graphs by Low-Rank Stress Majorization
Computer Graphics Forum
Manual clustering refinement using interaction with blobs
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
Grouse: feature-based, steerable graph hierarchy exploration
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
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
Winding roads: routing edges into bundles
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
Untangling graphs representing spatial relationships driven by drawing aesthetics
Proceedings of the 17th Panhellenic Conference on Informatics
Fast layout computation of clustered networks: Algorithmic advances and experimental analysis
Information Sciences: an International Journal
| Hi-index | 0.00 |
Force-directed graph drawing algorithms are widely used for drawing general graphs. However, these methods do not guarantee a sub-quadratic running time in general. We present a new force-directed method that is based on a combination of an efficient multilevel scheme and a strategy for approximating the repulsive forces in the system by rapidly evaluating potential fields. Given a graph G=(V,E), the asymptotic worst case running time of this method is O(|V|log|V|+|E|) with linear memory requirements. In practice, the algorithm generates nice drawings of graphs containing 100000 nodes in less than 5 minutes. Furthermore, it clearly visualizes even the structures of those graphs that turned out to be challenging for some other methods.