Constrained graph layout by stress majorization and gradient projection

DOI10.1016/j.disc.2007.12.103zbMath1201.05093OpenAlexW2134697945MaRDI QIDQ1011768

Tim Dwyer, Kim Marriott, Yehuda Koren

Publication date: 9 April 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.103

zbMATH Keywords

constraintsgraph drawinggradient projectionstress majorization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

A fast successive over-relaxation algorithm for force-directed network graph drawing ⋮ Anisotropic Radial Layout for Visualizing Centrality and Structure in Graphs ⋮ Stochastic Gradient Descent Works Really Well for Stress Minimization

Uses Software

• MatrixMarket
• IPSep-CoLa

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Constrained graph layout
• An algorithm for drawing general undirected graphs
• Modern multidimensional scaling. Theory and applications.
• Warm-Start Strategies in Interior-Point Methods for Linear Programming
• Numerical Optimization
• Navigating Clustered Graphs Using Force-Directed Methods
• Graph Drawing
• Graph Drawing
• Graph Drawing
• Graph Drawing

This page was built for publication: Constrained graph layout by stress majorization and gradient projection