A Multilevel Algorithm for Force-Directed Graph Drawing

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

Volumn 1984, Issue , 2001, Pages 171-182

  Walshaw, C ^a  

^a UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DRAWING (GRAPHICS); GRAPH THEORY; HEURISTIC METHODS;

FORCE-DIRECTED; FORCE-DIRECTED PLACEMENT; GLOBAL QUALITY; GRAPH DRAWING; MULTI-LEVEL PROCESS; MULTILEVEL ALGORITHM; MULTILEVEL TECHNIQUE; VERTEX GRAPHS;

DIRECTED GRAPHS;

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

References (15)

1. R. Davidson and D. Harel. Drawing Graphs Nicely using Simulated Annealing. ACM Trans. Graphics, 15(4):301-331, 1996.
2. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, New Jersey, U.S.A., 1998.
3. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Planarity-Preserving Cluste- ring and Embedding for Large Planar Graphs. In J. Kratochvfifil, editor, Proc. 7th Int. Symp. Graph Drawing, volume 1731 Of LNCS. Springer, 1999.
4. P. Eades. A Heuristic for Graph Drawing. Congressus Numerantium, 42:149-160, 1984.
5. P. Eades and Q. Feng. Multilevel Visualization of Clustered Graphs. In Proc. 6th Int. Symp. Graph Drawing, volume 1190 Of LNCS, pages 101-112. Springer, 1996.
6. P. Eades, Q. Feng, X. Lin, and H. Nagamochi. Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Tech. rep. 98-03, Dept. Comp. Sci., Univ. Newcastle, Callaghan 2308, Australia, 1998.
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. R. Hadany and D. Harel. A Multi-Scale Algorithm for Drawing Graphs Nicely. Tech. Rep. CS99-01, Weizmann Inst. Sci., Faculty Maths. Comp. Sci., Jan, 1999.
9. D. Harel and Y. Koren. A Fast Multi-Scale Algorithm for Drawing Large Graphs. Tech. Rep. CS99-21, Weizmann Inst. Sci., Faculty Maths. Comp. Sci., Nov, 1999.
10. B. Hendrickson and R. Leland. A Multilevel Algorithm for Partitioning Graphs. In S. Karin, editor, Proc. Supercomputing '95. ACM Press, 1995.
11. C. H. Papadimitriou and K. Stieglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, Englewood Clifis, NJ, 1982.
12. R. Sablowski and A. Frick. Automatic Graph Clustering. In Proc. 6th Int. Symp. Graph Drawing, volume 1190 Of LNCS, pages 395-400. Springer, 1996.
13. D. Tunkelang. JIGGLE: Java Interactive General Graph Layout Environment. In S. H. Whitesides, editor, Proc. 6th Int. Symp. Graph Drawing, volume 1547 Of LNCS, pages 413-422. Springer, 1998.
14. C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. Tech. Rep. 00/IM/60, Univ. Greenwich, London SE10 9LS, UK, April 2000.
15. C. Walshaw. A Multilevel Approach to the Travelling Salesman Problem. Tech. Rep. 00/IM/63, Univ. Greenwich, London SE10 9LS, UK, Aug. 2000.