Drawing large graphs with a potential-field-based multilevel algorithm

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 285-295

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

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; GRAPH THEORY; LINEARIZATION; DIRECTED GRAPHS; DRAWING (GRAPHICS); GRAPHIC METHODS;

FORCE-DIRECTED METHOD; GRAPH DRAWING ALGORITHMS; MULTILEVEL ALGORITHMS; REPULSIVE FORCES;

DRAWING (GRAPHICS); GRAPH THEORY;

EXTENDED ABSTRACTS; FORCE-DIRECTED GRAPH DRAWING ALGORITHMS; FORCE-DIRECTED METHOD; MEMORY REQUIREMENTS; MULTILEVEL ALGORITHM; MULTILEVEL SCHEMES; POTENTIAL FIELD; REPULSIVE FORCES;

EID: 24144445382     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. S. Aluru et al. Distribution-Independent Hierarchical Algorithms for the N-body Problem. Journal of Supercomputing, 12:303-323, 1998.
2. The AT&T graph collection: www.graphdrawing.org
3. J. Barnes and P. Hut. A hierarchical script O sign(NlogN) force-calculation algorithm. Nature, 324(4):446-449, 1986.
4. R. Davidson and D. Harel. Drawing Graphs Nicely Using Simulated Annealing. ACM Transaction on Graphics, 15(4):301-331, 1996.
5. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
6. T. M. J. Fruchterman and E. M. Reingold. Graph Drawing by Force-directed Placement. Software-Practice and Experience, 21(11):1129-1164, 1991.
7. P. Gajer et al. A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs. In J. Marks, editor, Graph Drawing 2000, volume 1984 of Lecture Notes in Computer Science, pages 211-221. Springer-Verlag, 2001.
8. L. F. Greengard. The Rapid Evaluation of Potential Fields in Particle Systems. ACM distinguished dissertations. The MIT Press, Cambridge, Massachusetts, 1988.
9. D. Harel and Y. Koren. A Fast Multi-scale Method for Drawing Large Graphs. In J. Marks, editor, Graph Drawing 2000, volume 1984 of Lecture Notes in Computer Science, pages 183-196. Springer-Verlag, 2001.
10. D. Harel and Y. Koren. Graph Drawing by High-Dimensional Embedding. In M. T. Goodrich and S. G. Kobourov, editors, Graph Drawing 2002, volume 2528 of Lecture Notes in Computer Science, pages 207-219. Springer-Verlag, 2002.
11. M. Jünger et al. Graph Drawing Software, volume XII of Mathematics and Visualization, chapter AGD - A Library of Algorithms for Graph Drawing, pages 149-169. Springer-Verlag, 2004.
12. T. Kamada and S. Kawai. An Algorithm for Drawing General Undirected Graphs. Information Processing Letters, 31:7-15, 1989.
13. Y. Koren et al. Drawing Huge Graphs by Algebraic Multigrid Optimization. Multiscale Modeling and Simulation, 1(4):645-673, 2003.
14. A. Quigley and P. Eades. FADE: Graph Drawing, Clustering, and Visual Abstraction. In J. Marks, editor, Graph Drawing 2000, volume 1984 of Lecture Notes in Computer Science, pages 197-210. Springer-Verlag, 2001.
15. D. Tunkelang. JIGGLE: Java Interactive Graph Layout Environment. In S. H. Whitesides, editor, Graph Drawing 1998, volume 1547 of Lecture Notes in Computer Science, pages 413-422. Springer-Verlag, 1998.
16. C. Walshaw's graph collection: www.gre.ac.uk/~c.walshaw/partition
17. C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. In J. Marks, editor, Graph Drawing 2000, volume 1984 of Lecture Notes in Computer Science, pages 171-182. Springer-Verlag, 2001.