Large-graph layout algorithms at work: An experimental study

Journal of Graph Algorithms and Applications

Volumn 11, Issue 2, 2007, Pages 345-369

  Hachul, Stefan ^a   Jünger, Michael ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DRAWING (GRAPHICS);

ALGEBRAIC APPROACHES; ARTIFICIAL WORLDS; FORCE-DIRECTED; GRAPH LAYOUT ALGORITHMS; LARGE GRAPH LAYOUT; LARGE GRAPHS; REAL-WORLD GRAPHS; RUNNING TIME;

DIRECTED GRAPHS;

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

References (24)

1. The AT&T graph collection: www.graphdrawing.org.
2. F. Brandenburg, M. Himsolt, and C. Rohrer. An Experimental Comparison of Force-Directed and Randomized Graph Drawing Methods. In Graph Drawing 1995, volume 1027 of LNCS, pages 76-87. Springer-Verlag, 1996.
3. U. Brandes and D. Wagner. In Graph Drawing Software, volume XII of Mathematics and Visualization, chapter visone-Analysis and Visualization of Social Networks, pages 321-340. Springer-Verlag, 2004.
4. R. Davidson and D. Harel. Drawing Graphs Nicely Using Simulated Annealing. ACM Transactions on Graphics, 15(4):301-331, 1996.
5. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
6. A. Frick, A. Ludwig, and H. Mehldau. A Fast Adaptive Layout Algorithm for Undirected Graphs. In Graph Drawing 1994, volume 894 of LNCS, pages 388-403. Springer-Verlag, 1995.
7. T. Fruchterman and E. Reingold. Graph Drawing by Force-directed Placement. Software-Practice and Experience, 21(11):1129-1164, 1991.
8. P. Gajer, M. Goodrich, and S. Kobourov. A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. In Graph Drawing 2000, volume 1984 of LNCS, pages 211-221. Springer-Verlag, 2001.
9. P. Gajer and S. Kobourov. GRIP: Graph Drawing with Intelligent Placement. In Graph Drawing 2000, volume 1984 of LNCS, pages 222-228. Springer-Verlag, 2001.
10. T. Gonzalez. Clustering to Minimize the Maximum Inter-Cluster Distance. Theoretical Computer Science, 38:293-306, 1985.
11. S. Hachul. A Potential-Field-Based Multilevel Algorithm for Drawing Large Graphs. PhD thesis, Institut für Informatik, Universität zu Köln, Germany, 2005. http://kups.ub.uni-koeln.de/volltexte/2005/1409.
12. S. Hachul and M. Jünger. Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm (Extended Abstract). In Graph Drawing 2004, volume 3383 of Lecture Notes in Computer Science, pages 285-295. Springer-Verlag, 2005.
13. D. Harel and Y. Koren. A Fast Multi-scale Method for Drawing Large Graphs. In Graph Drawing 2000, volume 1984 of LNCS, pages 183-196. Springer-Verlag, 2001.
14. D. Harel and Y. Koren. Graph Drawing by High-Dimensional Embedding. In Graph Drawing 2002, volume 2528 of LNCS, pages 207-219. Springer-Verlag, 2002.
15. M. Jünger, G. Klau, P. Mutzel, and R. Weiskircher. In Graph Drawing Software, volume XII of Mathematics and Visualization, chapter AGD-A Library of Algorithms for Graph Drawing, pages 149-172. Springer-Verlag, 2004.
16. T. Kamada and S. Kawai. An Algorithm for Drawing General Undirected Graphs. Information Processing Letters, 31:7-15, 1989.
17. Y. Koren, L. Carmel, and D. Harel. Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation, 1(4):645-673, 2003.
18. Y. Koren's algorithms: research. att. com/~yehuda/index_programs. html.
19. J. Manning. Computational complexity of geometric symmetry detection in graphs. In Great Lakes Computer Science Conference, volume 507 of Lecture Nodes in Computer Science, pages 1-7. Springer-Verlag, 1990.
20. A. Quigley and P. Eades. FADE: Graph Drawing, Clustering, and Visual Abstraction. In Graph Drawing 2000, volume 1984 of LNCS, pages 197-210. Springer-Verlag, 2001.
21. D. Tunkelang. JIGGLE: Java Interactive Graph Layout Environment. In Graph Drawing 1998, volume 1547 of LNCS, pages 413-422. Springer-Verlag, 1998.
22. C. Walshaw's graph collection: staffweb. cms. gre. ac. uk/~c. walshaw/partition.
23. C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. In Graph Drawing 2000, volume 1984 of LNCS, pages 171-182. Springer-Verlag, 2001.
24. R. Yusufov's implementation of GRIP: www.cs.arizona.edu/~kobourov/GRIP.