An experimental evaluation of multilevel layout methods

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

Volumn 6502 LNCS, Issue , 2011, Pages 80-91

  Bartel, Gereon ^a   Gutwenger, Carsten ^a   Klein, Karsten ^a   Mutzel, Petra ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL EVALUATION; EXPERIMENTAL STUDIES; LAYOUT ALGORITHMS; LAYOUT METHODS; QUALITY CRITERIA; RUNNING TIME; ENERGY-BASED;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DRAWING (GRAPHICS);

EID: 79952262270     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-18469-7_8     Document Type: Conference Paper

References (19)

1. The Open Graph Drawing Framework, http://www.ogdf.net
2. The AT&T graph library, http://www.graphdrawing.org.
3. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice-Hall, Englewood Cliffs (1999)
4. Brandenburg, F.J., Himsolt, M., Rohrer, C.: An experimental comparison of force-directed and randomized graph drawing algorithms. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 76-87. Springer, Heidelberg (1996)
5. Brandes, U., Pich, C.: An experimental study on distance-based graph drawing. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 218-229. Springer, Heidelberg (2009)
6. Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graph. 15(4), 301-331 (1996)
7. Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149-160 (1984)
8. Frishman, Y., Tal, A.: Multi-level graph layout on the GPU. IEEE Transactions on Visualization and Computer Graphics 13(6), 1310-1319 (2007)
9. Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exper. 21(11), 1129-1164 (1991)
10. Gajer, P., Kobourov, S.G.: GRIP: Graph drawing with intelligent placement. J. Graph Algorithms Appl. 6(3), 203-224 (2002)
11. Godiyal, A., Hoberock, J., Garland, M., Hart, J.C.: Rapid multipole graph drawing on the GPU. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 90-101. Springer, Heidelberg (2009)
12. Gronemann, M.: Engineering the fast-multipole-multilevel method for multicore and SIMD architectures. Master's thesis, Technische Universität Dortmund (2009)
13. Hachul, S., Jünger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285-295. Springer, Heidelberg (2005)
14. Hachul, S., Jünger, M.: Large-graph layout algorithms at work: An experimental study. J. Graph Algorithms Appl. 11(2), 345-369 (2007)
15. Han, K., Ju, B.-H., Park, J.H.: InterViewer: Dynamic visualization of protein-protein interactions, http://interviewer.inha.ac.kr/
16. Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Information Processing Letters 31(1), 7-15 (1989)
17. Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)
18. Walshaw, C.: The graph partitioning archive, http://staffweb.cms.gre.ac. uk/~c.walshaw/partition/
19. Walshaw, C.: A multilevel algorithm for force-directed graph-drawing. J. Graph Algorithms Appl. 7(3), 253-285 (2003)