A unified approach to approximation algorithms for bottleneck problems
Journal of the ACM (JACM)
An algorithm for drawing general undirected graphs
Information Processing Letters
Graph drawing by force-directed placement
Software—Practice & Experience
Drawing graphs nicely using simulated annealing
ACM Transactions on Graphics (TOG)
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
GD '95 Proceedings of the Symposium on Graph Drawing
A Multi-Scale Algorithm for Drawing Graphs Nicely
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
A Multi-scale Algorithm for the Linear Arrangement Problem
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Visual Exploration of Complex Time-Varying Graphs
IEEE Transactions on Visualization and Computer Graphics
Rapid Multipole Graph Drawing on the GPU
Graph Drawing
AMT'10 Proceedings of the 6th international conference on Active media technology
An LOD model for graph visualization and its application in web navigation
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Sub-sampling for efficient spectral mesh processing
CGI'06 Proceedings of the 24th international conference on Advances in Computer Graphics
An experimental comparison of fast algorithms for drawing general large graphs
GD'05 Proceedings of the 13th international conference on Graph Drawing
Energy-based clustering of graphs with nonuniform degrees
GD'05 Proceedings of the 13th 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
Manual clustering refinement using interaction with blobs
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
A scalable parallel force-directed graph layout algorithm
EG PGV'08 Proceedings of the 8th Eurographics conference on Parallel Graphics and Visualization
ISMIS'12 Proceedings of the 20th international conference on Foundations of Intelligent Systems
Considering formal assessment in learning analytics within a PLE: the HOU2LEARN case
Proceedings of the Third International Conference on Learning Analytics and Knowledge
| Hi-index | 0.00 |
We present a multi-scale layout algorithm for the aesthetic drawing of undirected graphs with straight-line edges. The algorithm is extremely fast, and is capable of drawing graphs of substantially larger size than any other algorithm we are aware of. For example, the algorithm achieves optimal drawings of 1000 vertex graphs in about 2 seconds. The paper contains graphs with over 6000 nodes. The proposed algorithm embodies a new multi-scale scheme for drawing graphs, which was motivated by the recently published multi-scale algorithm of Hadany and Harel [7]. It can significantly improve the speed of essentially any force-directed method (regardless of that method's ability of drawing weighted graphs or the continuity of its cost-function).