An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Spectral compression of mesh geometry
Proceedings of the 27th annual conference on Computer graphics and interactive techniques
Drawing graphs: methods and models
Drawing graphs: methods and models
Visualization of bibliographic networks with a reshaped landscape metaphor
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
A multi scale algorithm for drawing graphs nicely
Discrete Applied Mathematics - special issue on the 25th international workshop on graph theoretic concepts in computer science (WG'99)
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Proceedings of the conference on Visualization '01
Graph Visualization and Navigation in Information Visualization: A Survey
IEEE Transactions on Visualization and Computer Graphics
A Multi-dimensional Approach to Force-Directed Layouts of Large Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Fast Multi-scale Method for Drawing Large Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Multilevel Algorithm for Force-Directed Graph Drawing
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
Continuous nonlinear dimensionality reduction by kernel eigenmaps
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Visualization of labeled data using linear transformations
INFOVIS'03 Proceedings of the Ninth annual IEEE conference on Information visualization
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
The Binary Stress Model for Graph Drawing
Graph Drawing
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Eigensolver methods for progressive multidimensional scaling of large data
GD'06 Proceedings of the 14th international conference on Graph drawing
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
Drawing Large Graphs by Low-Rank Stress Majorization
Computer Graphics Forum
| Hi-index | 0.00 |
We show a novel approach for accelerating the computation of graph drawing algorithms. The method is based on the notion that we can find a subspace with a relatively low dimensionality that captures the "nice" layouts of the graph. This way each axis of the drawing is a linear combination of a few basis vectors, instead of being an arbitrary vector in Rn (n is the number of nodes). We describe ways of constructing these basis vectors and also algorithms for optimizing the graph drawing in the resulting subspace.