A fast and effective heuristic for the feedback arc set problem
Information Processing Letters
An interactive constraint-based system for drawing graphs
Proceedings of the 10th annual ACM symposium on User interface software and technology
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
Constraints
GD '95 Proceedings of the Symposium on Graph Drawing
GD '96 Proceedings of the Symposium on Graph Drawing
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs
GD '98 Proceedings of the 6th International Symposium on Graph Drawing
DIG-COLA: Directed Graph Layout through Constrained Energy Minimization
INFOVIS '05 Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization
Drawing Directed Graphs Using Quadratic Programming
IEEE Transactions on Visualization and Computer Graphics
Drawing graphs with non-uniform vertices
Proceedings of the Working Conference on Advanced Visual Interfaces
Integrating edge routing into force-directed layout
GD'06 Proceedings of the 14th international conference on Graph drawing
Stress majorization with orthogonal ordering constraints
GD'05 Proceedings of the 13th international conference on Graph Drawing
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
Designing semantic substrates for visual network exploration
Information Visualization
Visual analysis of importance and grouping in software dependency graphs
Proceedings of the 4th ACM symposium on Software visualization
Satisficing scrolls: a shortcut to satisfactory layout
Proceedings of the eighth ACM symposium on Document engineering
Topology Preserving Constrained Graph Layout
Graph Drawing
Analyzing (social media) networks with NodeXL
Proceedings of the fourth international conference on Communities and technologies
Integrating edge routing into force-directed layout
GD'06 Proceedings of the 14th international conference on Graph drawing
Constrained stress majorization using diagonally scaled gradient projection
GD'07 Proceedings of the 15th international conference on Graph drawing
Hi-tree layout using quadratic programming
Diagrams'10 Proceedings of the 6th international conference on Diagrammatic representation and inference
Layout with circular and other non-linear constraints using procrustes projection
GD'09 Proceedings of the 17th international conference on Graph Drawing
Scalable, versatile and simple constrained graph layout
EuroVis'09 Proceedings of the 11th Eurographics / IEEE - VGTC conference on Visualization
ImPrEd: an improved force-directed algorithm that prevents nodes from crossing edges
EuroVis'11 Proceedings of the 13th Eurographics / IEEE - VGTC conference on Visualization
Visual access to graph content using magic lenses and filtering
Proceedings of the 28th Spring Conference on Computer Graphics
| Hi-index | 0.00 |
We extend the popular force-directed approach to network (or graph) layout to allow separation constraints, which enforce a minimum horizontal or vertical separation between selected pairs of nodes. This simple class of linear constraints is expressive enough to satisfy a wide variety of application-specific layout requirements, including: layout of directed graphs to better show flow; layout with non-overlapping node labels; and layout of graphs with grouped nodes (called clusters). In the stress majorization force-directed layout process, separation constraints can be treated as a quadratic programming problem. We give an incremental algorithm based on gradient projection for efficiently solving this problem. The algorithm is considerably faster than using generic constraint optimization techniques and is comparable in speed to unconstrained stress majorization. We demonstrate the utility of our technique with sample data from a number of practical applications including gene-activation networks, terrorist networks and visualization of high-dimensional data.