Abstract
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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aluru, S., et al.: Distribution-Independent Hierarchical Algorithms for the N-body Problem. Journal of Supercomputing 12, 303–323 (1998)
The AT&T graph collection, www.graphdrawing.org
Barnes, J., Hut, P.: A hierarchical \(\mathcal{O}\)(N logN) force-calculation algorithm. Nature 324(4), 446–449 (1986)
Davidson, R., Harel, D.: Drawing Graphs Nicely Using Simulated Annealing. ACM Transaction on Graphics 15(4), 301–331 (1996)
Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149–160 (1984)
Fruchterman, T.M.J., Reingold, E.M.: Graph Drawing by Force-directed Placement. Software–Practice and Experience 21(11), 1129–1164 (1991)
Gajer, P., et al.: A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 211–221. Springer, Heidelberg (2001)
Greengard, L.F.: The Rapid Evaluation of Potential Fields in Particle Systems. In: ACM distinguished dissertations. The MIT Press, Cambridge (1988)
Harel, D., Koren, Y.: A Fast Multi-scale Method for Drawing Large Graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 183–196. Springer, Heidelberg (2001)
Harel, D., Koren, Y.: Graph Drawing by High-Dimensional Embedding. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 207–219. Springer, Heidelberg (2002)
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)
Kamada, T., Kawai, S.: An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31, 7–15 (1989)
Koren, Y., et al.: Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation 1(4), 645–673 (2003)
Quigley, A., Eades, P.: FADE: Graph Drawing, Clustering, and Visual Abstraction. In: Marks, J. (ed.) GD 2000. LNCS, vol. 1984, pp. 197–210. Springer, Heidelberg (2001)
Tunkelang, D.: JIGGLE: Java Interactive Graph Layout Environment. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 413–422. Springer, Heidelberg (1999)
C. Walshaw’s graph collection, http://www.gre.ac.uk/~c.walshaw/partition
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hachul, S., Jünger, M. (2005). Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm. In: Pach, J. (eds) Graph Drawing. GD 2004. Lecture Notes in Computer Science, vol 3383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_29
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24528-5
Online ISBN: 978-3-540-31843-9
eBook Packages: Computer ScienceComputer Science (R0)