Graph drawing by stress majorization
From MaRDI portal
Recommendations
Cited in
(52)- Constrained graph layout by stress majorization and gradient projection
- Visualizing the effects of a changing distance on data using continuous embeddings
- An improved force-directed graph layout algorithm based on aesthetic criteria
- A force-directed algorithm for drawing directed graphs symmetrically
- A greedy heuristic for crossing-angle maximization
- Data-driven graph drawing techniques with applications for conveyor systems
- A simple visualization method for three-dimensional (3D) network
- A quality metric for visualization of clusters in graphs
- Stress-Plus-X (SPX) graph layout
- Drawing large graphs by multilevel maxent-stress optimization
- A sparse stress model
- Node overlap removal by growing a tree
- An experimental study on the ply number of straight-line drawings
- A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
- The Binary Stress Model for Graph Drawing
- Efficient Node Overlap Removal Using a Proximity Stress Model
- An Experimental Study on Distance-Based Graph Drawing
- Topology Preserving Constrained Graph Layout
- A fast successive over-relaxation algorithm for force-directed network graph drawing
- An experimental study on the ply number of straight-line drawings
- Anisotropic radial layout for visualizing centrality and structure in graphs
- A regularized graph layout framework for dynamic network visualization
- Graph drawing by classical multidimensional scaling: new perspectives
- Graph Drawing via Gradient Descent, (GD)^2
- Stochastic Gradient Descent Works Really Well for Stress Minimization
- Exploring the Design Space of Aesthetics with the Repertory Grid Technique
- New Quality Metrics for Dynamic Graph Drawing
- scientific article; zbMATH DE number 7525513 (Why is no real title available?)
- A sparse stress model
- Constrained Stress Majorization Using Diagonally Scaled Gradient Projection
- Graph Drawing
- Graph Drawing
- Connected-closeness: A Visual Quantification of Distances in Network Layouts
- Stress of a graph and its computation
- Spherical graph drawing by multi-dimensional scaling
- Shape-faithful graph drawings
- An annotated review on graph drawing and its applications
- Visualizing evolving trees
- On the perception of small sub-graphs
- Balancing between the local and global structures (LGS) in graph embedding
- The appeals of quadratic majorization-minimization
- Visualizing large graphs
- Introducing fairness in graph visualization (poster abstract)
- The perception of stress in graph drawings
- Connectivity-faithful graph drawing
- Bundling-aware graph drawing
- LON/D -- sub-problem landscape analysis in decomposition-based multi-objective optimization
- Same quality metrics, different graph drawings
- NNP-net: accelerating t-SNT graph drawing for very large graphs by neural networks
- Stress in graph drawings: perception, preference, and performance
- Winning the DG challenge for the 4th time: our approach (graph drawing contest abstract)
- Complex systems: features, similarity and connectivity
This page was built for publication: Graph drawing by stress majorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5711610)
