712 search results - page 55 / 143 » On Spectral Graph Drawing |
112
Voted
GBRPR
2009
Springer
15 years 8 months ago
2009
Springer
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
112
Voted
SIAMCOMP
2000
15 years 2 months ago
2000
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
96
Voted
GD
2009
Springer
15 years 6 months ago
2009
Springer
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
71
Voted
CAE
2007
15 years 4 months ago
2007
The discipline of graph visualization produces pictorial representations of node
112
Voted
RSA
2010
15 years 18 days ago
2010
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and deri...