Sciweavers

712 search results - page 17 / 143
» On Spectral Graph Drawing
Sort
View
JGAA
1998
116views more  JGAA 1998»
13 years 7 months ago
New Lower Bounds For Orthogonal Drawings
An orthogonal drawing of a graph is an embedding of the graph in the two-dimensional grid such that edges are routed along grid-lines. In this paper we explore lower bounds for or...
Therese C. Biedl
VISSYM
2007
13 years 10 months ago
Online Dynamic Graph Drawing
This paper presents an algorithm for drawing a sequence of graphs online. The algorithm strives to maintain the global structure of the graph and thus the user's mental map, ...
Yaniv Frishman, Ayellet Tal
COLT
2004
Springer
14 years 27 days ago
On the Convergence of Spectral Clustering on Random Samples: The Normalized Case
Given a set of n randomly drawn sample points, spectral clustering in its simplest form uses the second eigenvector of the graph Laplacian matrix, constructed on the similarity gra...
Ulrike von Luxburg, Olivier Bousquet, Mikhail Belk...
SOFSEM
2005
Springer
14 years 29 days ago
Volumes of 3D Drawings of Homogenous Product Graphs
d Abstract) Lubomir Torok Institute of Mathematics and Computer Science Slovak Academy of Sciences Severna 5, 974 01 Banska Bystrica, Slovak Republic 3-dimensional layout of graph...
Lubomir Torok
GD
2004
Springer
14 years 26 days ago
Drawing Power Law Graphs
It has been noted that many realistic graphs have a power law degree distribution and exhibit the small world phenomenon. We present drawing methods influenced by recent developm...
Reid Andersen, Fan R. K. Chung, Lincoln Lu