Constrained Stress Majorization Using Diagonally Scaled Gradient Projection

DOI10.1007/978-3-540-77537-9_23zbMath1137.68480OpenAlexW2135403888MaRDI QIDQ5452226

Kim Marriott, Tim Dwyer

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_23

zbMATH Keywords

constraintsgraph layout

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

A fast successive over-relaxation algorithm for force-directed network graph drawing ⋮ Constrained Stress Majorization Using Diagonally Scaled Gradient Projection

Uses Software

• IPSep-CoLa

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for drawing general undirected graphs
• Modern multidimensional scaling. Theory and applications.
• Emergence of Scaling in Random Networks
• Integrating Edge Routing into Force-Directed Layout
• Constrained Stress Majorization Using Diagonally Scaled Gradient Projection
• Graph Drawing

This page was built for publication: Constrained Stress Majorization Using Diagonally Scaled Gradient Projection