The following pages link to Graph Drawing (Q5897627):
Displaying 14 items.
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- Constrained graph layout by stress majorization and gradient projection (Q1011768) (← links)
- Removing node overlapping in graph layout using constrained optimization (Q1405333) (← links)
- Node overlap removal algorithms: a comparative study (Q2206849) (← links)
- A new algorithm for removing node overlapping in graph visualization (Q2372206) (← links)
- Node Overlap Removal by Growing a Tree (Q2961502) (← links)
- An augmented proximity stress model for edge label overlap removal (Q2993679) (← links)
- Graph Compact Orthogonal Layout Algorithm (Q3195336) (← links)
- Efficient, Proximity-Preserving Node Overlap Removal (Q3402374) (← links)
- Efficient Node Overlap Removal Using a Proximity Stress Model (Q3611853) (← links)
- Removing Node Overlaps Using Multi-sphere Scheme (Q3611863) (← links)
- Node Overlap Removal Algorithms: an Extended Comparative Study (Q5141647) (← links)
- Node Overlap Removal by Growing a Tree (Q5367026) (← links)
- A simple pipeline for orthogonal graph drawing (Q6618259) (← links)