A multilevel algorithm for force-directed graph-drawing

Journal of Graph Algorithms and Applications

Volumn 7, Issue 3, 2003, Pages 253-285

  Walshaw, Chris ^a  

^a UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Force directed placement; Graph drawing; Multilevel optimisation

Indexed keywords

DIRECTED GRAPHS; DRAWING (GRAPHICS);

ADJACENT VERTICES; FORCE-DIRECTED; FORCE-DIRECTED PLACEMENT; GRAPH DRAWING; GRAPH G; MULTILEVEL ALGORITHM; MULTILEVEL OPTIMIZATION; MULTILEVEL TECHNIQUE; MULTILEVELS; PLACEMENT ALGORITHM;

HEURISTIC METHODS;

EID: 4043141349     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00070     Document Type: Article

References (22)

1. R. Davidson and D. Harel. Drawing Graphs Nicely using Simulated Annealing. ACM Trans. Graphics, 15(4):301-331, 1996.
2. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs, NJ, 1998.
3. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Planarity-Preserving Clustering and Embedding for Large Planar Graphs. In J. Kratochvíl, editor, Proc. 7th Intl. Symp. Graph Drawing, volume 1731 of LNCS. Springer, Berlin, 1999.
4. P. Eades. A Heuristic for Graph Drawing. Congr. Numer., 42:149-160, 1984.
5. P. Eades and Q. Feng. Multilevel Visualization of Clustered Graphs. In Proc. 4th Intl. Symp. Graph Drawing, volume 1190 of LNCS, pages 101-112. Springer, Berlin, 1996.
6. P. Eades, Q. Feng, X. Lin, and H. Nagamochi. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Tech. rep. 98-03, Dept. Comp. Sci., Univ. Newcastle, Callaghan 2308, Australia, 1998.
7. T. M. J. Fruchterman and E. M. Reingold. Graph Drawing by Force-Directed Placement. Software - Practice & Experience, 21(11):1129-1164, 1991.
8. P. Gajer, M. T. Goodrich, and S. G. Kobourov. A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. In J. Marks, editor, Graph Drawing, 8th Intl. Symp. GD 2000, volume 1984 of LNCS, pages 211-221. Springer, Berlin, 2001.
9. R. Hadany and D. Harel. A Multi-Scale Algorithm for Drawing Graphs Nicely. Discrete Applied Mathematics, 113(1):3-21, 2001.
10. D. Harel and Y. Koren. A Fast Multi-Scale Algorithm for Drawing Large Graphs. J. Graph Algorithms Appl., 6(3):179-202, 2002.
11. D. Harel and Y. Koren. Graph Drawing by High-Dimensional Embedding. In S. G. Kobourov and M. T. Goodrich, editors, Proc. Graph Drawing, 10th Intl. Symp. GD 2002, volume 2528 of LNCS, pages 207-219. Springer, Berlin, 2002.
12. B. Hendrickson and R. Leland. A Multilevel Algorithm for Partitioning Graphs. In S. Karin, editor, Proc. Supercomputing '95, San Diego. ACM Press, New York, 1995.
13. T. Kamada and S. Kawai. An Algorithm for Drawing General Undirected Graphs. Information Process. Lett., 31(1):7-15, 1989.
14. Y. Koren, L. Carmel, and D. Harel. ACE: A Fast Multiscale Eigenvector Computation for Drawing Huge Graphs. In Proc. IEEE Symp. Information Visualization (InfoVis'02), pages 137-144. IEEE, Piscataway, NJ, 2002.
15. C. H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Englewood Cliffs, NJ, 1982.
16. H. Purchase. Which Aesthetic has the Greatest Effect on Human Understanding? In G. Di Battista, editor, Proc. 5th Intl. Symp. Graph Drawing, volume 1353 of LNCS, pages 248-261. Springer, Berlin, 1997.
17. R. Sablowski and A. Frick. Automatic Graph Clustering. In Proc. 4th Intl. Symp. Graph Drawing, volume 1190 of LNCS, pages 395-400. Springer, Berlin, 1996.
18. D. Tunkelang. JIGGLE: Java Interactive General Graph Layout Environment. In S. H. Whitesides, editor, Proc. 6th Intl. Symp. Graph Drawing, volume 1547 of LNCS, pages 413-422. Springer, Berlin, 1998.
19. C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. In J. Marks, editor, Graph Drawing, 8th Intl. Symp. GD 2000, volume 1984 of LNCS, pages 171-182. Springer, Berlin, 2001.
20. C. Walshaw. Multilevel Refinement for Combinatorial Optimisation Problems. (To appear in Annals Oper. Res.; originally published as Univ. Greenwich Tech. Rep. 01/IM/73), 2001.
21. C. Walshaw and M. Cross. Mesh Partitioning: a Multilevel Balancing and Refinement Algorithm. SIAM J. Sci. Comput., 22(1):63-80, 2000. (originally published as Univ. Greenwich Tech. Rep. 98/IM/35).
22. R. J. Webber. Finding the Best Viewpoints for Three-Dimensional Graph Drawings. PhD thesis, Dept. Comp. Sci., Univ. Newcastle, Callaghan 2308, Australia, 1998.