CHI '86 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Communications of the ACM
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Aesthetics-based graph layout for human consumption
Software—Practice & Experience
Drawing graphs: methods and models
Drawing graphs: methods and models
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Parallel Multilevel Graph Partitioning
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Parallel Simulated Annealing Algorithm for Generating 3D Layouts of Undirected Graphs
GD '95 Proceedings of the 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
A Fast Adaptive Layout Algorithm for Undirected Graphs
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Multilevel Visualization of Clustered Graphs
GD '96 Proceedings of the Symposium on Graph Drawing
Drawing Large Graphs with H3Viewer and Site Manager
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Sourcebook of parallel computing
Sourcebook of parallel computing
BiblioViz: a system for visualizing bibliography information
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Multi-Level Graph Layout on the GPU
IEEE Transactions on Visualization and Computer Graphics
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
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
Distributed force-directed graph layout and visualization
EG PGV'06 Proceedings of the 6th Eurographics conference on Parallel Graphics and Visualization
Data organization and visualization using self-sorting map
Proceedings of Graphics Interface 2011
HD-GraphViz: highly distributed graph visualization on tiled displays
Proceedings of the Eighth Indian Conference on Computer Vision, Graphics and Image Processing
Hi-index | 0.00 |
Understanding the structure, dynamics, and evolution of large graphs is becoming increasingly important in a variety of fields. The demand for visual tools to aid in this process is rising accordingly. Yet, many algorithms that create good representations of small and medium-sized graphs do not scale to larger graph sizes. The exploitation of the massive computational power provided by parallel and distributed computing is a natural progression for handling important problems such as large graph layout. In this paper, we present a scalable parallel graph layout algorithm based on the force-directed model. Our algorithm requires minimal pre-processing and achieves scalability by conducting the layout computation in stages - a portion of the graph at a time, and decreasing the amount of inter-processor communication as the layout computation progresses. We provide the implementation details of our algorithm, evaluate its performance and scalability, and compare the visual quality of the resulting drawings against some of the classic and the fastest algorithms for the layout of general graphs.