Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm
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.
- 2.The AT&T graph collection, www.graphdrawing.org
- 8.Greengard, L.F.: The Rapid Evaluation of Potential Fields in Particle Systems. In: ACM distinguished dissertations. The MIT Press, Cambridge (1988)Google Scholar
- 11.Jünger, M., et al.: AGD - A Library of Algorithms for Graph Drawing. In: Graph Drawing Software. Mathematics and Visualization, vol. XII, pp. 149–169. Springer, Heidelberg (2004)Google Scholar
- 16.C. Walshaw’s graph collection, http://www.gre.ac.uk/~c.walshaw/partition
- 17.Walshaw, C.: A Multilevel Algorithm for Force-Directed Graph Drawing. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 171–182. Springer, Heidelberg (2001)Google Scholar