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
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
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
Hi-index | 0.00 |
Applying the multilevel paradigm to energy-based layout algorithms can improve both the quality of the resulting drawings as well as the running time of the layout computation. In order to do this, approaches for the different multilevel phases refinement, placement, layout, and optionally scaling and postprocessing need to be implemented. A number of multilevel layout algorithms have been proposed already, which differ in the way these phases are realized. We present an experimental study that investigates the influence of varying combinations with respect to running time and quality criteria.