ACE: A fast multiscale eigenvectors computation for drawing huge graphs

Proceedings - IEEE Symposium on Information Visualization, INFO VIS

Volumn 2002-January, Issue , 2002, Pages 137-144

  Koren, Yehuda ^a   Carmel, L ^a   Harel, D ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Clustering algorithms; Computer science; Data visualization; Eigenvalues and eigenfunctions; Image segmentation; Joining processes; Laplace equations; Mathematics; Minimization methods; Partitioning algorithms

Indexed keywords

ALGEBRA; ALGORITHMS; CLUSTERING ALGORITHMS; COMPUTER SCIENCE; DATA VISUALIZATION; DRAWING (GRAPHICS); IMAGE SEGMENTATION; INFORMATION ANALYSIS; INFORMATION SCIENCE; INFORMATION SYSTEMS; LAPLACE EQUATION; MATHEMATICAL TECHNIQUES; VISUALIZATION;

ALGEBRAIC MULTIGRIDS; GENERALIZED EIGENVALUE PROBLEMS; GRAPH DRAWING ALGORITHMS; JOINING PROCESS; MINIMIZATION METHODS; MINIMIZATION PROBLEMS; ORDERS OF MAGNITUDE; PARTITIONING ALGORITHMS;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 84935030768     PISSN: 1522404X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFVIS.2002.1173159     Document Type: Conference Paper

References (22)

1. S. T. Barnard and H. D. Simon, "A Fast Multilevel Implementation of Recursive Spectral Bisection for Partitioning Unstructured Problems", Concurrency: Practice & Experience 6 (1994), 101-117.
2. U. Brandes and T. Willhalm, "Visualizing Bibliographic Networks with a Reshaped Landscape Metaphor", Proc. 4th Joint Eurographics - IEEE TVCG Symp. Visualization (VisSym '02), pp. 159-164, ACM Press, 2002.
3. A. Brandt, "Algebraic Multigrid Theory: The Symmetric Case", Applied Mathematics and Computation, 19 (1986) 23-56.
4. L. Carmel, Y. Koren and D. Harel, "Visualizing and Classifying Odors Using a Similarity Matrix", to appear in the 9th International Symposium on Olfaction and Electronic Nose (ISOEN02), September 29 - October 2, 2002.
5. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Graph Drawing: Algorithms for the Visualization of Graphs, Prentice-Hall, 1999.
6. P. Gajer, M. T. Goodrich, and S. G. Kobourov, "A Multidimensional Approach to Force-Directed Layouts of Large Graphs", Graph Drawing 2000, LNCS 1984, pp. 211-221, Springer Verlag, 2000.
7. J. W. Gardner and P. N. Bartlett, Electronic Noses, Principles and Applications, Oxford University Press, New York, USA, 1999.
8. R. Hadany and D. Harel, "A Multi-Scale Method for Drawing Graphs Nicely", Discrete Applied Mathematics 113 (2001), 3-21.
9. K. M. Hall, "An r-dimensional Quadratic Placement Algorithm", Management Science 17 (1970), 219-229.
10. D. Harel and Y. Koren, "A Fast Multi-scale Method for Drawing Large Graphs", Graph Drawing 2000, LNCS 1984, pp. 183-196, Springer Verlag, 2000.
11. D. Harel and Y. Koren, "Graph Drawing by High-Dimensional Embedding", to appear in Proceedings of Graph Drawing 2002, Springer Verlag.
12. I. Herman, G. Melancon and M. S. Marshall, "Graph Visualisation and Navigation in Information Visualisation", IEEE Transactions on Visualization and Computer Graphics 6 (2000), 24-43.
13. M. Juvan and B. Mohar, "Optimal linear labelings and eigenvalues of graphs",Discrete Applied Mathematics 36 (1992), 153-168.
14. M. Kaufmann and D. Wagner (Eds.), Drawing Graphs: Methods and Models, LNCS 2025, Springer Verlag, 2001.
15. Y. Koren, L. Carmel and D. Harel "ACE: A Fast Multiscale Eigen-vectors Computation for Drawing Huge Graphs", Technical Report MCS01-17, The Weizmann Institute of Science, 2001. Available at: www.wisdom.weizmann.ac.il/reports.html.
16. Y. Koren "On Spectral Graph Drawing", manuscript, 2002.
17. C. C. Paige and M. A. Saunders, "Solution of Sparse Indefinite Systems of Linear Equations", SIAM J. Numer. Anal. 12 (1975), 617-629.
18. A. Quigley and P. Eades, "FADE: Graph Drawing, Clustering, and Visual Abstraction", Graph Drawing 2000, LNCS 1984, pp. 183-196, Springer Verlag, 2000.
19. J. Shi and J. Malik, "Normalized Cuts and Image Segmentation", IEEE Conference Computer Vision and Pattern Recognition, pp. 731-737, 1997.
20. K. Stueben, "An Introduction to Algebraic Multigrid", Appendix A in Multigrid (U. Trottenberg, C.W. Oosterlee, and A. Schuller, eds.), Academic Press, London, 2000.
21. C. Walshaw, "A Multilevel Algorithm for Force-Directed Graph Drawing", Graph Drawing 2000, LNCS 1984, pp. 171-182, Springer Verlag, 2000.
22. D. S. Watkins, Fundamentals of Matrix Computations, John Wiley, New York, NY, USA, 1991.