The 
Mathematica Journal
Volume 10, Issue 1

Search

In This Issue
Articles
Trott's Corner
New Products
New Publications
Calendar
News Bulletins
New Resources
Classifieds

Download This Issue 

About the Journal
Editorial Policy
Staff and Contributors
Submissions
Subscriptions
Advertising
Back Issues
Contact Information

Efficient, High-Quality Force-Directed Graph Drawing
Yifan Hu

References

[1] J. Barnes and P. Hut, "A Hierarchical O(n log n) Force-Calculation Algorithm," Nature, 324(4), 1986 pp. 446-449.

[2] C. Walshaw, "A Multilevel Algorithm for Force-Directed Graph Drawing," Journal of Graph Algorithms and Applications, 7(3), 2003 pp. 253-285.

[3] G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Englewood Cliffs, NJ: Prentice Hall, 1999.

[4] T. M. J. Fruchterman and E. M. Reigold, "Graph Drawing by Force-Directed Placement," Software--Practice and Experience, 21(11), 1991 pp. 1129-1164.

[5] P. Eades, "A Heuristic for Graph Drawing," Congressus Numerantium, 42, 1984 pp. 149-160.

[6] N. R. Quinn and M. A. Breuer, "A Force Directed Component Placement Procedure for Printed Circuit Boards," IEEE Transactions on Circuits and Systems, CAS-26(6), 1979 pp. 377-388.

[7] T. Kamada and S. Kawai, "An Algorithm for Drawing General Undirected Graphs," Information Processing Letters, 31(1), 1989 pp. 7-15.

[8] Y. Koren, L. Carmel, and D. Harel, "Drawing Huge Graphs by Algebraic Multigrid Optimization," Multiscale Modeling and Simulation, 1(4), 2003 pp. 645-673.

[9] D. Harel and Y. Koren, "Graph Drawing by High-Dimensional Embedding," Journal of Graph Algorithms and Applications, 8(2), 2004 pp. 195-214.

[10] G. Karypis and V. Kumar, "Multilevel k-way Partitioning Scheme for Irregular Graphs," Journal of Parallel and Distributed Computing, 48(1), 1998 pp. 96-129.

[11] B. Hendrickson and R. Leland, "A Multilevel Algorithm for Partitioning Graphs," Technical Report SAND93-1301, Albuquerque, NM: Sandia National Laboratories, 1993. Also in Proceeding of Supercomputing'95 (SC95), San Diego, CA www.supercomp.org/sc95/proceedings/509_BHEN/SC95.HTM.

[12] C. Walshaw, M. Cross, and M. G. Everett, "Parallel Dynamic Graph Partitioning for Adaptive Unstructured Meshes," Journal of Parallel and Distributed Computing, 47(2), 1997 pp. 102-108.

[13] D. Harel and Y. Koren, "A Fast Multi-Scale Method for Drawing Large Graphs," Journal of Graph Algorithms and Applications, 6(3), 2002 pp. 179-202.

[14] R. Hadany and D. Harel, "A Multi-Scale Algorithm for Drawing Graphs Nicely," Discrete Applied Mathematics, 113(1), 2001 pp. 3-21.

[15] P. Gajer, M. T. Goodrich, and S. G. Kobourov, "A Fast Multi-Dimensional Algorithm for Drawing Large Graphs," Lecture Notes in Computer Science, 1984, New York: Springer-Verlag, 2000 pp. 211-221.

[16] D. Tunkelang, "A Numerical Optimization Approach to General Graph Drawing," Ph.D. thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1999.

[17] A. Quigley and P. Eades, "Fade: Graph Drawing, Clustering, and Visual Abstraction," Lecture Notes in Computer Science, 1984, New York: Springer-Verlag, 2000 pp. 183-196.

[18] A. Quigley, "Large Scale Relational Information Visualization, Clustering, and Abstraction," Ph.D. thesis, Department of Computer Science and Software Engineering, University of Newcastle, Australia, 2001.

[19] R. Davison and D. Harel, "Drawing Graphs Nicely Using Simulated Annealing," ACM Transactions on Graphics, 15(4), 1996 pp. 301-331.

[20] R. Fletcher, Practical Methods of Optimization, 2nd ed., New York: John Wiley & Sons, 2000.

[21] K. J. Pulo, "Recursive Space Decompositions in Force-Directed Graph Drawing Algorithms," in Proceedings of the Australian Symposium on Information Visualisation (InVis.au 2001), Sydney, Australia (P. Eades and T. Pattison, eds.), Conferences in Research and Practice in Information Technology Series, 9, Darlinghurst, Australia: Australian Computer Society, 2001 pp. 95-102.

[22] S. Pfalzner and P. Gibbon, Many-Body Tree Methods in Physics, New York: Cambridge University Press, 1996.

[23] A. Gupta, G. Karypis, and V. Kumar, "Highly Scalable Parallel Algorithms for Sparse Matrix Factorization," IEEE Transactions on Parallel and Distributed Systems, 8(5), 1997 pp. 502-520.

[24] Y. F. Hu and J. A. Scott, "A Multilevel Algorithm for Wavefront Reduction," SIAM Journal on Scientific Computing, 23(4), 2001 pp.1352-1375.

[25] C. Walshaw, "A Multilevel Approach to the Travelling Salesman Problem," Operations Research, 50(5), 2002 pp. 862-877.

[26] C. Walshaw, "Multilevel Refinement for Combinatorial Optimisation Problems," Annals of Operations Research, 131, 2004 pp. 325-372; originally published as University of Greenwich Technical Report 01/IM/73, 2001.

[27] S. T. Barnard and H. D. Simon, "A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems," Concurrency: Practice and Experience, 6(2), 1994 pp. 101-117.

[28] S. Hachul and M. Jünger, "Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm," in Proceedings of the Twelfth International Symposium on Graph Drawing (GD 2004), New York (J. Pach, ed.), Lecture Notes in Computer Science, 3383, New York: Springer-Verlag, 2004 pp. 285-295.

[29] L. F. Greenguard, The Rapid Evaluation of Potential Fields in Particle Systems, ACM Distinguished Dissertations Series, Cambridge, MA: The MIT Press, 1988.



     
About Mathematica | Download Mathematica Player
© Wolfram Media, Inc. All rights reserved.