712 search results - page 1 / 143 » On Spectral Graph Drawing |
GD
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
COCOON
2003
Springer
13 years 11 months ago
2003
Springer
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 abili...
GD
2005
Springer
13 years 11 months ago
2005
Springer
GD
2004
Springer
13 years 11 months ago
2004
Springer
We propose a method for drawing AS graph data using 2.5D graph visualization. In order to bring out the pure graph structure of the AS graph we consider its core hierarchy. The k-c...
ICPR
2008
IEEE
14 years 5 days ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...