Sciweavers

712 search results - page 84 / 143
» On Spectral Graph Drawing
Sort
View
CIC
2004
107views Communications» more  CIC 2004»
13 years 10 months ago
Hexagonal and Pruned Torus Networks as Cayley Graphs
Hexagonal mesh and torus, as well as honeycomb and certain other pruned torus networks, are known to belong to the class of Cayley graphs which are node-symmetric and possess othe...
Wenjun Xiao, Behrooz Parhami
ICALP
2007
Springer
14 years 3 months ago
Quasi-randomness and Algorithmic Regularity for Graphs with General Degree Distributions
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
Noga Alon, Amin Coja-Oghlan, Hiêp Hàn...
GD
2006
Springer
14 years 16 days ago
Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
We present a novel sampling-based approximation technique for classical multidimensional scaling that yields an extremely fast layout algorithm suitable even for very large graphs....
Ulrik Brandes, Christian Pich
ASUNAM
2010
IEEE
13 years 10 months ago
Pixel-Oriented Visualization of Change in Social Networks
We propose a new approach to visualize social networks. Most common network visualizations rely on graph drawing. While without doubt useful, graphs suffer from limitations like cl...
Klaus Stein, Rene Wegener, Christoph Schlieder
SAC
2009
ACM
14 years 3 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang