Efficient, High-Quality Force-Directed Graph Drawing

We propose a graph drawing algorithm that is both efficient and high quality. This algorithm combines a multilevel approach, which effectively overcomes local minimums, with the Barnes and Hut [1] octree technique, which approximates shortand long-range force efficiently. Our numerical results show that the algorithm is comparable in speed to Walshaw’s [2] highly efficient multilevel graph drawing algorithm, yet gives better results on some of the difficult problems. In addition, an adaptive cooling scheme for the force-directed algorithms and a general repulsive force model are proposed. The proposed graph drawing algorithm and others are included with Mathematica 5.1 and later versions in the package DiscreteMath‘GraphÑ Plot.

[1]  N. Quinn,et al.  A forced directed component placement procedure for printed circuit boards , 1979 .

[2]  M. Breuer,et al.  Correction to 'A Force Directed Component Placement Procedure for Printed Circuit Boards' , 1980 .

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

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

[5]  Roger Fletcher,et al.  Practical methods of optimization; (2nd ed.) , 1987 .

[6]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[7]  L. Greengard.  The Rapid Evaluation of Potential Fields in Particle Systems , 1988 .

[8]  李幼升,et al.  Ph , 1989 .

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

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

[11]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

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

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

[14]  Paul Gibbon,et al.  Many-body tree methods in physics , 1996 .

[15]  Vipin Kumar,et al.  Highly Scalable Parallel Algorithms for Sparse Matrix Factorization , 1997, IEEE Trans. Parallel Distributed Syst..

[16]  Martin G. Everett,et al.  Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes , 1997, J. Parallel Distributed Comput..

[17]  George Karypis,et al.  Multilevel k-way Partitioning Scheme for Irregular Graphs , 1998, J. Parallel Distributed Comput..

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

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

[20]  Michael T. Goodrich,et al.  A Fast Multi-Dimensional Algorithm for Drawing Large Graphs? , 2000 .

[21]  David Harel,et al.  A Fast Multi-scale Method for Drawing Large Graphs , 2000, Graph Drawing.

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

[23]  Jennifer A. Scott,et al.  A Multilevel Algorithm for Wavefront Reduction , 2001, SIAM J. Sci. Comput..

[24]  K. J. Pulo.  Recursive Space Decompositions in Force-Directed Graph Drawing Algorithms , 2001, InVis.au.

[25]  Chris Walshaw,et al.  A Multilevel Approach to the Travelling Salesman Problem , 2002, Oper. Res..

[26]  A Multilevel Algorithm for Force-Directed Graph-Drawing , 2003, J. Graph Algorithms Appl..

[27]  David Harel,et al.  Drawing Huge Graphs by Algebraic Multigrid Optimization , 2003, Multiscale Model. Simul..

[28]  Graph Drawing by High-Dimensional Embedding , 2004, J. Graph Algorithms Appl..

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

[30]  Chris Walshaw,et al.  Multilevel Refinement for Combinatorial Optimisation Problems , 2004, Ann. Oper. Res..