A sparse stress model
From MaRDI portal
Recommendations
Cites work
- A Multilevel Algorithm for Force-Directed Graph-Drawing
- A sparse stress model
- An r-Dimensional Quadratic Placement Algorithm
- An Experimental Study on Distance-Based Graph Drawing
- Clustering large graphs via the singular value decomposition
- COAST: A Convex Optimization Approach to Stress-Based Embedding
- Drawing large graphs by multilevel maxent-stress optimization
- Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
- Graph Drawing
- Graph Drawing
- Graph drawing by classical multidimensional scaling: new perspectives
- scientific article; zbMATH DE number 1693556 (Why is no real title available?)
- scientific article; zbMATH DE number 46317 (Why is no real title available?)
- scientific article; zbMATH DE number 3605829 (Why is no real title available?)
- scientific article; zbMATH DE number 2080100 (Why is no real title available?)
- scientific article; zbMATH DE number 1893565 (Why is no real title available?)
- Modern multidimensional scaling. Theory and applications.
- The University of Florida sparse matrix collection
Cited in
(10)- Data-driven graph drawing techniques with applications for conveyor systems
- A quality metric for visualization of clusters in graphs
- Stress-Plus-X (SPX) graph layout
- The Binary Stress Model for Graph Drawing
- Drawing dynamic graphs without timeslices
- New Quality Metrics for Dynamic Graph Drawing
- A sparse stress model
- StressD: 2D stress estimation using denoising diffusion model
- FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing
- Connectivity-faithful graph drawing
This page was built for publication: A sparse stress model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2961500)