Abstract

The spectral approach for graph visualization computes the layout of a graph using certain eigenvectors of related matrices. Some important advantages of this approach are an ability to compute optimal layouts (according to specific requirements) and a very rapid computation time. In this paper we explore spectral visualization techniques and study their properties. We present a novel view of the spectral approach, which provides a direct link between eigenvectors and the aesthetic properties of the layout. In addition, we present a new formulation of the spectral drawing method with some aesthetic advantages. This formulation is accompanied by an aesthetically-motivated algorithm, which is much easier to understand and to implement than the standard numerical algorithms for computing eigenvectors.

Citations

1824	Normalized cuts and image segmentation - Shi, Malik - 1997
437	Partitioning sparse matrices with eigenvectors of graphs - Pothen, Simon, et al. - 1990
314	How to draw a graph - Tutte - 1962
132	KM: An r-dimensional quadratic placement algorithm - Hall - 1970
113	The Laplacian spectrum of graphs - Mohar
56	ACE: a fast multiscale eigenvector computation for huge graphs - Koren, Harel, et al. - 2002
52	Optimal linear labelings and eigenvalues of graphs - Juvan, Mohar - 1992
36	D.: Drawing Graphs - Kaufmann, Wagner - 2001
24	Visualizing Bibliographic Networks with a Reshaped Landscape Metaphor - Brandes, Willhalm - 2002
11	Visualizing and Classifying Odors Using a Similarity Matrix - Carmel, Koren, et al. - 2003
10	SHAWE-TAYLOR J.: Characterizing graph drawing with eigenvectors - PISANSKI
6	Molecular Graphs, Point Groups and Fullerenes - Manolopoulos, Fowler - 1992
3	A New Feature Extraction Technique for Electronic Noses - Carmel, Lancet, et al. - 2002
2	Spectral Graph Theory, CBMS Reg - Chung - 1997
1	Solution of Constrained Quadratic Optimization Problems In this appendix we study a certain kind of constrained optimization problem, whose solution is a generalized eigenvector. We use two matrices: (1) A —ann×n real symmetric positive-semidefinite matri - Webb, Recognition, et al. - 1999