Introduction to algorithms
Fundamentals of matrix computations
Fundamentals of matrix computations
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Drawing graphs: methods and models
Drawing graphs: methods and models
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
Fast Interactive 3-D Graph Visualization
GD '95 Proceedings of the Symposium on Graph Drawing
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
FADE: Graph Drawing, Clustering, and Visual Abstraction
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
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
A scalable method for visualising changes in portfolio data
APVis '03 Proceedings of the Asia-Pacific symposium on Information visualisation - Volume 24
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
INFOVIS '02 Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02)
A high-dimensional approach to interactive graph visualization
Proceedings of the 2004 ACM symposium on Applied computing
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
Topological Fisheye Views for Visualizing Large Graphs
IEEE Transactions on Visualization and Computer Graphics
Visualising changes in fund manager holdings in two and a half-dimensions
Information Visualization
An extended high-dimensional method for interactive graph drawing
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
Extending the WilmaScope 3D graph visualisation system: software demonstration
APVis '05 proceedings of the 2005 Asia-Pacific symposium on Information visualisation - Volume 45
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Architecture-aware FPGA placement using metric embedding
Proceedings of the 43rd annual Design Automation Conference
TreePlus: Interactive Exploration of Networks with Enhanced Tree Layouts
IEEE Transactions on Visualization and Computer Graphics
Smashing Peacocks Further: Drawing Quasi-Trees from Biconnected Components
IEEE Transactions on Visualization and Computer Graphics
TopoLayout: Multilevel Graph Layout by Topological Features
IEEE Transactions on Visualization and Computer Graphics
From Web to Map: Exploring the World of Music
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Rapid Multipole Graph Drawing on the GPU
Graph Drawing
An Experimental Study on Distance-Based Graph Drawing
Graph Drawing
One-dimensional layout optimization, with applications to graph drawing by axis separation
Computational Geometry: Theory and Applications
Improved efficiency of spring embedders: taking advantage of GPU programming
VIIP '07 The Seventh IASTED International Conference on Visualization, Imaging and Image Processing
Drawing graphs by eigenvectors: theory and practice
Computers & Mathematics with Applications
SSDE: fast graph drawing using sampled spectral distance embedding
GD'06 Proceedings of the 14th international conference on Graph drawing
Eigensolver methods for progressive multidimensional scaling of large data
GD'06 Proceedings of the 14th international conference on Graph drawing
Human-centered visualization environments
Human-centered visualization environments
Graph embedding using commute time
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
SDE: graph drawing using spectral distance embedding
GD'05 Proceedings of the 13th international conference on Graph Drawing
Graph drawing by stress majorization
GD'04 Proceedings of the 12th international conference on Graph Drawing
Drawing large graphs with a potential-field-based multilevel algorithm
GD'04 Proceedings of the 12th international conference on Graph Drawing
Curvilinear graph drawing using the force-directed method
GD'04 Proceedings of the 12th international conference on Graph Drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
Drawing Large Graphs by Low-Rank Stress Majorization
Computer Graphics Forum
Visualisation and analysis of large and complex scale-free networks
EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
Grouse: feature-based, steerable graph hierarchy exploration
EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization
Graph drawing by subspace optimization
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
GD'12 Proceedings of the 20th international conference on Graph Drawing
Graph drawing by classical multidimensional scaling: new perspectives
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.01 |
We present a novel approach to the aesthetic drawing of undirected graphs. The method has two phases: first embed the graph in a very high dimension and then project it into the 2-D plane using principal components analysis. Running time is linear in the graph size, and experiments we have carried out show the ability of the method to draw graphs of 105 nodes in few seconds. The new method appears to have several advantages over classical methods, including a significantly better running time, a useful inherent capability to exhibit the graph in various dimensions, and an effective means for interactive exploration of large graphs.