Sciweavers

712 search results - page 3 / 143
» On Spectral Graph Drawing
Sort
View
CVIU
2006
105views more  CVIU 2006»
13 years 5 months ago
The representation and matching of categorical shape
We present a framework for categorical shape recognition. The coarse shape of an object is captured by a multiscale blob decomposition, representing the compact and elongated part...
Ali Shokoufandeh, Lars Bretzner, Diego Macrini, M....
GD
2004
Springer
13 years 11 months ago
A Note on the Self-similarity of Some Orthogonal Drawings
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
Maurizio Patrignani
ACSC
2004
IEEE
13 years 9 months ago
Flexible Layering in Hierarchical Drawings with Nodes of Arbitrary Size
Graph drawing is an important area of information visualization which concerns itself with the visualization of relational data structures. Relational data like networks, hierarch...
Carsten Friedrich, Falk Schreiber
JCT
2007
83views more  JCT 2007»
13 years 5 months ago
On the largest eigenvalue of non-regular graphs
We study the spectral radius of connected non-regular graphs. Let λ1(n,Δ) be the maximum spectral radius among all connected non-regular graphs with n vertices and maximum degre...
Bolian Liu, Jian Shen, Xinmao Wang
APVIS
2007
13 years 7 months ago
Straight-line grid drawings of planar graphs with linear area
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
Md. Rezaul Karim, Md. Saidur Rahman