A fast multi-scale method for drawing large graphs

Journal of Graph Algorithms and Applications

Volumn 6, Issue 3, 2002, Pages 177-202

  Harel, David ^a   Koren, Yehuda ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED GRAPHS; UNDIRECTED GRAPHS;

COST-FUNCTION; FORCE-DIRECTED METHOD; LARGE GRAPHS; LAYOUT ALGORITHMS; MULTI-SCALES; MULTISCALE METHOD; UNDIRECTED GRAPH; VERTEX GRAPHS; WEIGHTED GRAPH;

COST FUNCTIONS;

EID: 4043171150     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00051     Document Type: Conference Paper

References (23)

1. [BH86] J. Barnes and P. Hut, "A hierarchical O(N log N) Force-Calculation Algorithm", Nature, 324 (1986), 446-449.
2. +95] F.J. Brandenburg, M. Himsolt and C. Rohrer, "An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms", Proceedings of Graph Drawing '95, Lecture Notes in Computer Science, Vol. 1027, pp. 76-87, Springer Verlag, 1995.
3. +99] G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.
4. [DH89] R. Davidson and D. Harel, "Drawing Graphs Nicely Using Simulated Annealing", ACM Trans. on Graphics 15 (1996), 301-331. (Preliminary version: Technical Report, The Weizmann Institute of Science, 1989.)
5. [Ea84] P. Eades, "A Heuristic for Graph Drawing",Congressus Numerantium 42 (1984), 149-160.
6. +94] A. Frick, A. Ludwig and H. Mehldau, "A Fast Adaptive Layout Algorithm for Undirected Graphs", Proceedings of Graph Drawing 1994, Lecture Notes in Computer Science, Vol. 894, pp. 389-403, Springer Verlag, 1995.
7. [FR91] T.M.G. Fruchterman and E. Reingold, "Graph Drawing by Force-Directed Placement", Software-Practice and Experience 21 (1991), 1129-1164.
8. +00] P. Gajer, M. T. Goodrich, and S. G. Kobourov, "A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs", Proceedings of Graph Drawing 2000, Lecture Notes in Computer Science, Vol. 1984, pp. 211-221, Springer Verlag, 2000.
9. [Go85] T. Gonzalez, "Clustering to Minimize the Maximum Inter-Cluster Distance", Theoretical Computer Science 38 (1985), 293-306.
10. [HH99] R. Hadany and D. Harel, "A Multi-Scale Method for Drawing Graphs Nicely", Discrete Applied Mathematics, 113 3-21 (2001). (Also, Proc. 25th Inter. Workshop on Graph-Theoretic Concepts in Computer Science (WG '99), Lecture Notes in Computer Science, Vol. 1665, pp. 262-277, Springer Verlag, 1999.)
11. [HH99] R. Hadany and D. Harel, "A Multi-Scale Method for Drawing Graphs Nicely", Discrete Applied Mathematics, 113 3-21 (2001). (Also, Proc. 25th Inter. Workshop on Graph-Theoretic Concepts in Computer Science (WG '99), Lecture Notes in Computer Science, Vol. 1665, pp. 262-277, Springer Verlag, 1999.)
12. [HK99] D. Harel and Y. Koren, "A Fast Multi-Scale Method for Drawing Large Graphs", Technical Report MCS99-21, Faculty of Mathematics and Computer Science, The Weizmann Institute of Science, 1999.
13. [HK02] D. Harel and Y. Koren, "A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs", to appear in Proceedings of Graph Drawing 2002, Lecture Notes in Computer Science, Springer Verlag.
14. [Ho96] D. S. Hochbaum (ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996.
15. [HS86] D. S. Hochbaum and D.B. Shmoys, "A Unified Approach to Approximation Algorithms for Bottleneck Problems", J. Assoc. Comput. Mach. 33 (1986), 533-550.
16. [KK89] T. Kamada and S. Kawai, "An Algorithm for Drawing General Undirected Graphs", Information Processing Letters 31 (1989), 7-15.
17. [KW01] M. Kaufmann and D. Wagner (Eds.), Drawing Graphs Methods and Models, Lecture Notes in Computer Science, Vol. 2025, Springer Verlag, 2001.
18. +01] Y. Koren, L. Carmel and D. Harel "ACE: A Fast Multiscale Eigen-vectors Computation for Drawing Huge Graphs", Technical Report MCS01-17, The Weizmann Institute of Science, 2001. Available at: www.wisdom.weizmann.ac.il/reports.html. To appear in Proceedings of IEEE Symposium on Information Visualization (InfoVis 2002).
19. +01] Y. Koren, L. Carmel and D. Harel "ACE: A Fast Multiscale Eigen-vectors Computation for Drawing Huge Graphs", Technical Report MCS01-17, The Weizmann Institute of Science, 2001. Available at: www.wisdom.weizmann.ac.il/reports.html. To appear in Proceedings of IEEE Symposium on Information Visualization (InfoVis 2002).
20. [LSD] The LSD library, available from the Graphlet website at http://www.fmi.uni-passau.de/Graphlet/download.html
21. [QE00] A. Quigley and P. Eades, "FADE: Fraph Drawing, Clustering, and Visual Abstraction", Proceedings of Graph Drawing 2000, Lecture Notes in Computer Science, Vol. 1984, pp. 183-196, Springer Verlag, 2000.
22. [Tu99] D. Tunkelang, A Numerical Optimization Approach to General Graph Drawing, Ph.D. Thesis, Carnegie Mellon University, 1999.
23. [Wa00] C. Walshaw, "A Multilevel Algorithm for Force-Directed Graph Drawing", Proceedings of Graph Drawing 2000, Lecture Notes in Computer Science, Vol. 1984, pp. 171-182, Springer Verlag, 2000.