Sciweavers

712 search results - page 50 / 143
» On Spectral Graph Drawing
Sort
View
JGAA
2000
89views more  JGAA 2000»
13 years 8 months ago
Dynamic WWW Structures in 3D
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
Ulrik Brandes, Vanessa Kääb, Andres L&ou...
ICPR
2008
IEEE
14 years 3 months ago
Object recognition using graph spectral invariants
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
Bai Xiao, Richard C. Wilson, Edwin R. Hancock
ICVS
2003
Springer
14 years 2 months ago
A Spectral Approach to Learning Structural Variations in Graphs
This paper shows how to construct a linear deformable model for graph structure by performing principal components analysis (PCA) on the vectorised adjacency matrix. We commence b...
Bin Luo, Richard C. Wilson, Edwin R. Hancock
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
14 years 26 days ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale
JCT
2006
54views more  JCT 2006»
13 years 8 months ago
Spectral estimates for Abelian Cayley graphs
We give two short proofs that for fixed d, a d-regular Cayley graph on an Abelian group of order n has second eigenvalue bounded below by d - O(dn-4/d), where the implied constant...
Joel Friedman, Ram Murty, Jean-Pierre Tillich