An algorithm for drawing general undirected graphs
Information Processing Letters
Drawing graphs to convey proximity: an incremental arrangement method
ACM Transactions on Computer-Human Interaction (TOCHI)
Matrix market: a web resource for test matrix collections
Proceedings of the IFIP TC2/WG2.5 working conference on Quality of numerical software: assessment and enhancement
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
An Experimental Comparison of Force-Directed and Randomized Graph Drawing Algorithms
GD '95 Proceedings of the Symposium on Graph Drawing
Improved Force-Directed Layouts
GD '98 Proceedings of the 6th International 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 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
A Nonlinear Mapping for Data Structure Analysis
IEEE Transactions on Computers
Graph drawing by subspace optimization
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
Drawing Directed Graphs Using Quadratic Programming
IEEE Transactions on Visualization and Computer Graphics
Visual analysis of network centralities
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
IPSep-CoLa: An Incremental Procedure for Separation Constraint Layout of Graphs
IEEE Transactions on Visualization and Computer Graphics
Journal of the American Society for Information Science and Technology
The Binary Stress Model for Graph Drawing
Graph Drawing
An Experimental Study on Distance-Based Graph Drawing
Graph Drawing
Topology Preserving Constrained Graph Layout
Graph Drawing
Dynamic network data exploration through semi-supervised functional embedding
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
DCS: A Distributed Coordinate System for Network Positioning
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
Integrating edge routing into force-directed layout
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
GD'06 Proceedings of the 14th international conference on Graph drawing
An as-rigid-as-possible approach to sensor network localization
ACM Transactions on Sensor Networks (TOSN)
Constrained stress majorization using diagonally scaled gradient projection
GD'07 Proceedings of the 15th international conference on Graph drawing
Visualizing internet evolution on the autonomous systems level
GD'07 Proceedings of the 15th international conference on Graph drawing
Proceedings of Graphics Interface 2010
Graph drawing aesthetics in user-sketched graph layouts
AUIC '10 Proceedings of the Eleventh Australasian Conference on User Interface - Volume 106
Semi-supervised constrained clustering: an expert-guided data analysis methodology
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
User-centric time-distance representation of road networks
GIScience'10 Proceedings of the 6th international conference on Geographic information science
Efficient visualization of document streams
DS'10 Proceedings of the 13th international conference on Discovery science
Discovering novelty in gene data: from sequential patterns to visualization
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part III
The concept maps method as a tool to evaluate the usability of APIs
Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Stress majorization with orthogonal ordering constraints
GD'05 Proceedings of the 13th international conference on Graph Drawing
High-throughput multi-dimensional scaling (HiT-MDS) for cDNA-array expression data
ICANN'05 Proceedings of the 15th international conference on Artificial Neural Networks: biological Inspirations - Volume Part I
GD'09 Proceedings of the 17th international conference on Graph Drawing
A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
GD'11 Proceedings of the 19th international conference on Graph Drawing
Sequential patterns mining and gene sequence visualization to discover novelty from microarray data
Journal of Biomedical Informatics
Drawing Large Graphs by Low-Rank Stress Majorization
Computer Graphics Forum
Force-directed edge bundling for graph visualization
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
Graph drawing by classical multidimensional scaling: new perspectives
GD'12 Proceedings of the 20th international conference on Graph Drawing
A regularized graph layout framework for dynamic network visualization
Data Mining and Knowledge Discovery
Stress functions for nonlinear dimension reduction, proximity analysis, and graph drawing
The Journal of Machine Learning Research
The "Map" in the mental map: Experimental results in dynamic graph drawing
International Journal of Human-Computer Studies
Interactive state-transition diagrams for visualization of multimodal annotation
Intelligent Data Analysis
Visual analysis of large-scale network anomalies
IBM Journal of Research and Development
Hi-index | 0.01 |
One of the most popular graph drawing methods is based on achieving graph-theoretic target distances. This method was used by Kamada and Kawai [15], who formulated it as an energy optimization problem. Their energy is known in the multidimensional scaling (MDS) community as the stress function. In this work, we show how to draw graphs by stress majorization, adapting a technique known in the MDS community for more than two decades. It appears that majorization has advantages over the technique of Kamada and Kawai in running time and stability. We also found the majorization-based optimization being essential to a few extensions to the basic energy model. These extensions can improve layout quality and computation speed in practice.