A fast multi-scale method for drawing large graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1984, Issue , 2001, Pages 183-196

  Harel, David ^a   Koren, Yehuda ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COST FUNCTIONS; DIRECTED GRAPHS; DRAWING (GRAPHICS); GRAPHIC METHODS;

FORCE-DIRECTED METHOD; LARGE GRAPHS; LAYOUT ALGORITHMS; MULTISCALE METHOD; UNDIRECTED GRAPH; VERTEX GRAPHS; WEIGHTED GRAPH;

GRAPH THEORY;

EID: 84958552647     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44541-2_18     Document Type: Conference Paper

References (11)

1. Brandenburg, F.J., Himsolt, M., and Rohrer, C., “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.
2. Di Battista, G., Eades, P., Tamassia, R. and Tollis, I.G., Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.
3. Davidson, R., and Harel, D., “Drawing Graphs Nicely Using Simulated Annealing", ACM Trans. on Graphics 15 (1996), 301-331.
4. Eades, P., “A Heuristic for Graph Drawing", Congressus Numerantium 42 (1984), 149-160.
5. Fruchterman, T.M.G., and Reingold, E., “Graph Drawing by Force-Directed Placement", Software-Practice and Experience 21 (1991), 1129-1164.
6. Gonzalez, T., “Clustering to Minimize the Maximum Inter-Cluster Distance", Theoretical Computer Science 38 (1985), 293-306.
7. Hadany, R., and Harel, D., “A Multi-Scale Method for Drawing Graphs Nicely", Discrete Applied Mathematics, in press, 2000. (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.)
8. Hochbaum, D. S. (ed.), Approximation Algorithms for NP-Hard Problems, PWS Publishing Company, 1996.
9. Hochbaum, D.S., and Shmoys, D. B, “A Unified Approach to Approximation Algorithms for Bottleneck Problems", J. Assoc. Comput. Mach. 33 (1986), 533-550.
10. Kamada, T., and Kawai, S., “An Algorithm for Drawing General Undirected Graphs", Information Processing Letters 31 (1989), 7-15.
11. The LSD library, available from the Graphlet website at http://www.fmi.uni-passau.de/Graphlet/download.html