Graph drawing by high-dimensional embedding

Journal of Graph Algorithms and Applications

Volumn 8, Issue 2, 2004, Pages 195-214

  Harel, David ^a   Koren, Yehuda ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); UNDIRECTED GRAPHS;

EMBEDDINGS; GRAPH DRAWING; GRAPH SIZES; HIGH-DIMENSIONAL; HIGHER DIMENSIONS; HIGHER-DIMENSIONAL; PRINCIPAL-COMPONENT ANALYSIS; RUNNING TIME; TWO PHASE; UNDIRECTED GRAPH;

PRINCIPAL COMPONENT ANALYSIS;

EID: 24344442752     PISSN: 15261719     EISSN: 15261719     Source Type: Journal    
DOI: 10.7155/jgaa.00089     Document Type: Conference Paper

References (22)

1. I. Bruss and A. Frick. Fast interactive 3-D graph visualization. In Proc. 3rd Graph Drawing (GD'95), pages 99-110. Lecture Notes in Computer Science, Vol. 1027, Springer-Verlag, 1996.
2. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
3. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Trans. on Graphics, 15:301-331, 1996.
4. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, 1999.
5. P. Eades. A heuristic for graph drawing. Congressus Numerantium, 42:149-160, 1984.
6. P. D. Eades, M. E. Houle, and R. Webber. Finding the best viewpoints for three-dimensional graph drawings. In Proc. 5th Graph Drawing (GD'97), pages 87-98. Lecture Notes in Computer Science, Vol. 1353, Springer-Verlag, 1997.
7. B. S. Everitt and G. Dunn. Applied Multivariate Data Analysis. Arnold, 1991.
8. T. M. G. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21:1129-1164, 1991.
9. P. Gajer, M. T. Goodrich, and S. G. Kobourov. A multi-dimensional approach to force-directed layouts of large graphs. In Proc. 8th Graph Drawing (GD'00), pages 211-221. Lecture Notes in Computer Science, Vol. 1984, Springer-Verlag, 2000.
10. R. Hadany and D. Harel. A multi-scale method for drawing graphs nicely. Discrete Applied Mathematics, 113:3-21, 2001.
11. D. Harel and Y. Koren. A fast multi-scale method for drawing large graphs. Journal of Graph Algorithms and Applications, 6:179-202, 2002.
12. D. S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, 1996.
13. M. E. Houle and R. Webber. Approximation algorithms for finding best viewpoints. In Proc. 6th Graph Drawing (GD'98), pages 210-223. Lecture Notes in Computer Science, Vol. 1547, Springer-Verlag, 1998.
14. T. Kamada and S. Kawai. An algorithm for drawing general undirected graphs. Information Processing Letters, 31:7-15, 1989.
15. M. Kaufmann and D. Wagner, editors. Drawing Graphs: Methods and Models. Lecture Notes in Computer Science, Vol. 2025, Springer-Verlag, 2001.
16. Y. Koren. Graph drawing by subspace optimization. In Proceedings of 6th Joint Eurographics - IEEE TCVG Symp. Visualization (VisSym'04), pages 65-74. Eurographics, 2004.
17. Y. Koren and L. Carmel. Robust linear dimensionality reduction. IEEE Transactions on Visualization and Computer Graphics, 10:459-470, 2003.
18. Y. Koren, L. Carmel, and D. Harel. ACE: A fast multiscale eigenvector computation for drawing huge graphs. In Proceedings of IEEE Information Visualization (Info Vis'02), pages 137-144. IEEE, 2002.
19. A. Quigley and P. Eades. FADE: Graph drawing, clustering, and visual abstraction. In Proc. 8th Graph Drawing (GD'00), pages 183-196. Lecture Notes in Computer Science, Vol. 1984, Springer-Verlag, 2000.
20. D. Tunkelang. A Numerical Optimization Approach to General Graph Drawing. PhD thesis, Carnegie Mellon University, 1999.
21. C. Walshaw. A multilevel algorithm for force-directed graph drawing. In Proc. 8th Graph Drawing (GD'00), pages 171-182. Lecture Notes in Computer Science, Vol. 1984, Springer-Verlag, 2000.
22. D. S. Watkins. Fundamentals of Matrix Computations. Wiley, 1991.