Stochastic Gradient Descent Works Really Well for Stress Minimization

DOI10.1007/978-3-030-68766-3_2OpenAlexW3135095106MaRDI QIDQ5014101

Ulrik Brandes, Katharina Börsig, Barna Pasztor

Publication date: 1 December 2021

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.10376

zbMATH Keywords

experimentsstochastic gradient descentmultidimensional scalingstress minimization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Spherical graph drawing by multi-dimensional scaling

Cites Work

• Unnamed Item
• Constrained graph layout by stress majorization and gradient projection
• An algorithm for drawing general undirected graphs
• Drawing Large Graphs by Multilevel Maxent-Stress Optimization
• The university of Florida sparse matrix collection
• A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing
• Untangling the Hairballs of Multi-Centered, Small-World Online Social Media Networks
• An Experimental Study on Distance-Based Graph Drawing
• A Sparse Stress Model
• Graph Drawing
• More Flexible Radial Layout

This page was built for publication: Stochastic Gradient Descent Works Really Well for Stress Minimization