The following pages link to Graph Drawing (Q5711610):
Displaying 33 items.
- A fast successive over-relaxation algorithm for force-directed network graph drawing (Q439759) (← links)
- A regularized graph layout framework for dynamic network visualization (Q468664) (← links)
- Complex systems: features, similarity and connectivity (Q823211) (← links)
- Constrained graph layout by stress majorization and gradient projection (Q1011768) (← links)
- Visualizing the effects of a changing distance on data using continuous embeddings (Q1658724) (← links)
- An improved force-directed graph layout algorithm based on aesthetic criteria (Q1685035) (← links)
- A force-directed algorithm for drawing directed graphs symmetrically (Q1721190) (← links)
- A greedy heuristic for crossing-angle maximization (Q1725762) (← links)
- Data-driven graph drawing techniques with applications for conveyor systems (Q1980856) (← links)
- A simple visualization method for three-dimensional (3D) network (Q2039162) (← links)
- A quality metric for visualization of clusters in graphs (Q2206839) (← links)
- Stress-Plus-X (SPX) graph layout (Q2206862) (← links)
- A Sparse Stress Model (Q2961500) (← links)
- Node Overlap Removal by Growing a Tree (Q2961502) (← links)
- An Experimental Study on the Ply Number of Straight-Line Drawings (Q2980905) (← links)
- A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing (Q3223947) (← links)
- The Binary Stress Model for Graph Drawing (Q3611852) (← links)
- Efficient Node Overlap Removal Using a Proximity Stress Model (Q3611853) (← links)
- An Experimental Study on Distance-Based Graph Drawing (Q3611854) (← links)
- Topology Preserving Constrained Graph Layout (Q3611855) (← links)
- An Experimental Study on the Ply Number of Straight-line Drawings (Q4622771) (← links)
- Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs (Q4625124) (← links)
- Graph Drawing via Gradient Descent, $$(GD)^2$$ (Q5014098) (← links)
- Stochastic Gradient Descent Works Really Well for Stress Minimization (Q5014101) (← links)
- Exploring the Design Space of Aesthetics with the Repertory Grid Technique (Q5014125) (← links)
- New Quality Metrics for Dynamic Graph Drawing (Q5014136) (← links)
- (Q5075824) (← links)
- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection (Q5452226) (← links)
- Connected-closeness: A Visual Quantification of Distances in Network Layouts (Q6051912) (← links)
- On the perception of small sub-graphs (Q6560150) (← links)
- Balancing between the local and global structures (LGS) in graph embedding (Q6560154) (← links)
- The appeals of quadratic majorization-minimization (Q6568947) (← links)
- Visualizing large graphs (Q6604447) (← links)
