An experimental comparison of fast algorithms for drawing general large graphs

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

Volumn 3843 LNCS, Issue , 2006, Pages 235-250

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

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; DRAWING (GRAPHICS); NUMERICAL ANALYSIS;

ALGEBRAIC APPROACHES; REAL-WORLD GRAPHS; STRAIGHTLINE DRAWINGS;

GRAPH THEORY;

EID: 33745668441     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_22     Document Type: Conference Paper

References (22)

1. The AT&T graph collection: www.graphdrawing.org.
2. F. J. 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. M. J. Fruchterman and E. M. Reingold. Graph Drawing by Force-directed Placement. Software-Practice and 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 Graph Drawing 2000, volume 1984 of LNCS, pages 211-221. Springer-Verlag, 2001.
9. P. Gajer and S. G. Kobourov. GRIP: Graph Drawing with Intelligent Placement. In Graph Drawing 2000, volume 1984 of LNCS, pages 222-228. Springer-Verlag, 2001.
10. 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.
11. 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.
12. 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.
13. 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.
14. M. Jünger, G. W. 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.
15. T. Kamada and S. Kawai. An Algorithm for Drawing General Undirected Graphs. Information Processing Letters, 31:7-15, 1989.
16. Y. Koren, L. Carmel, and D. Harel. Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation, 1(4):645-673, 2003.
17. Y. Koren's algorithms: research.att.com/~yehuda/index_programs.html.
18. 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.
19. D. Tunkelang. JIGGLE: Java Interactive Graph Layout Environment. In Graph Drawing 1998, volume 1547 of LNCS, pages 413-422. Springer-Verlag, 1998.
20. C. Walshaw's graph collection: staffweb.cms.gre.ac.uk/~c.walshaw/ partition.
21. C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. In Graph Drawing 2000, volume 1984 of LNCS, pages 171-182. Springer-Verlag, 2001.
22. R. Yusufov's implementation of GRIP: www.cs.arizona.edu/~kobourov/GRIP.