A Fast Multi-scale Method for Drawing Large Graphs
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graphs of substantially larger size than any other algorithm we are aware of. For example, the algorithm achieves optimal drawings of 1000 vertex graphs in about 2 seconds. The paper contains graphs with over 6000 nodes. The proposed algorithm embodies a new multi-scale scheme for drawing graphs, which was motivated by the recently published multi-scale algorithm of Hadany and Harel . It can significantly improve the speed of essentially any force-directed method (regardless of that method’s ability of drawing weighted graphs or the continuity of its cost-function).
- 1.Brandenburg, F.J., Himsolt, M., and Rohrer, C., “An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms”, Proceedings of Graph Drawing’ 95, Lecture Notes in Computer Science, Vol. 1027, pp. 76–87, Springer Verlag, 1995.Google Scholar
- 2.Di Battista, G., Eades, P., Tamassia, R. and Tollis, I.G., Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.Google Scholar
- 7.Hadany, R., and Harel, D., “A Multi-Scale Method for Drawing Graphs Nicely”, Discrete Applied Mathematics, in press, 2000. (Also, Proc. 25th Inter. Workshop on Graph-Theoretic Concepts in Computer Science (WG’ 99), Lecture Notes in Computer Science, Vol. 1665, pp. 262-277, Springer Verlag, 1999.)Google Scholar
- 8.Hochbaum, D. S. (ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996.Google Scholar