Sciweavers

712 search results - page 55 / 143
» On Spectral Graph Drawing
Sort
View
GBRPR
2009
Springer
14 years 3 months ago
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
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...
David Knossow, Avinash Sharma, Diana Mateus, Radu ...
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 8 months ago
On Bipartite Drawings and the Linear Arrangement Problem
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 ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
GD
2009
Springer
14 years 1 months ago
Upward Planarization Layout
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...
Markus Chimani, Carsten Gutwenger, Petra Mutzel, H...
CAE
2007
13 years 11 months ago
The Aesthetics of Graph Visualization
The discipline of graph visualization produces pictorial representations of node
Chris Bennett, Jody Ryall, Leo Spalteholz, Amy Goo...
RSA
2010
108views more  RSA 2010»
13 years 7 months ago
Resolvent of large random graphs
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...
Charles Bordenave, Marc Lelarge