A Fast Multi-level Algorithm for Drawing Large Undirected Graphs

Graph drawing is a standard means for visualizing the relational information. This paper presents a fast algorithm for drawing large undirected graphs with straight-line edges, which employs the multi-level method as the framework of the algorithm and adopts the force-directed algorithm combined with bary-centralizing method to refine the single-level layouts. As far as we know, it is the first attempt to introduce this kind of combination. Also, the other two speed-up methods, constraint-normalization and quad-tree space decomposition, are used. Systematic experiments suggest its high performance and nice results. It is extremely fast and can nicely draw 10,000 vertex graphs in approximately 5 seconds and 1000,000 vertex graphs in approximately 11 minutes. The comparison with the well-known algorithms proves its validity and practicality. Furthermore, the presented algorithm is easy to implement, and its techniques can be generalized to speed up general force-directed algorithms.

[1]  Michael S. Warren,et al.  Skeletons from the treecode closet , 1994 .

[2]  David Harel,et al.  A multi-scale algorithm for drawing graphs nicely , 2001, Discret. Appl. Math..

[3]  Yehuda Koren,et al.  On Spectral Graph Drawing , 2003, COCOON.

[4]  Michael Jünger,et al.  Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm , 2004, GD.

[5]  Leslie Greengard,et al.  A fast algorithm for particle simulations , 1987 .

[6]  David Harel,et al.  A fast multi-scale method for drawing large graphs , 2000, AVI '00.

[7]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

[8]  Chris Walshaw,et al.  Journal of Graph Algorithms and Applications a Multilevel Algorithm for Force-directed Graph-drawing , 2022 .

[9]  Daniel Tunkelang,et al.  A Numerical Optimization Approach to General Graph Drawing , 1999 .

[10]  Kenneth M. Hall.  An r-Dimensional Quadratic Placement Algorithm , 1970 .

[11]  David Harel,et al.  Graph Drawing by High-Dimensional Embedding , 2002, J. Graph Algorithms Appl..

[12]  Michael T. Goodrich,et al.  A multi-dimensional approach to force-directed layouts of large graphs , 2000, Comput. Geom..

[13]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[14]  Peter Eades,et al.  FADE: Graph Drawing, Clustering, and Visual Abstraction , 2000, GD.

[15]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[16]  David Harel,et al.  ACE: a fast multiscale eigenvectors computation for drawing huge graphs , 2002, IEEE Symposium on Information Visualization, 2002. INFOVIS 2002..

[17]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[18]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.

[19]  David Harel,et al.  Drawing graphs nicely using simulated annealing , 1996, TOGS.

[20]  Michael Kaufmann,et al.  Drawing graphs: methods and models , 2001 .

[21]  Michael Jünger,et al.  An Experimental Comparison of Fast Algorithms for Drawing General Large Graphs , 2005, GD.