Pages that link to "Item:Q3611854"
From MaRDI portal
The following pages link to An Experimental Study on Distance-Based Graph Drawing (Q3611854):
Displaying 13 items.
- An improved force-directed graph layout algorithm based on aesthetic criteria (Q1685035) (← links)
- Crossing numbers and stress of random graphs (Q1725756) (← links)
- Data-driven graph drawing techniques with applications for conveyor systems (Q1980856) (← links)
- Deep neural network for drawing networks, \({(DNN)^{ 2 }} \) (Q2151466) (← links)
- A quality metric for visualization of clusters in graphs (Q2206839) (← links)
- Solving Distance Geometry Problem with Inexact Distances in Integer Plane (Q2815204) (← links)
- A Sparse Stress Model (Q2961500) (← links)
- A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing (Q3223947) (← links)
- Experimental studies on graph drawing algorithms (Q4789076) (← links)
- Stochastic Gradient Descent Works Really Well for Stress Minimization (Q5014101) (← links)
- New Quality Metrics for Dynamic Graph Drawing (Q5014136) (← links)
- Connected-closeness: A Visual Quantification of Distances in Network Layouts (Q6051912) (← links)
- Visualizing large graphs (Q6604447) (← links)
