Stochastic Gradient Descent Works Really Well for Stress Minimization

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

Authors: Katharina Börsig, Ulrik Brandes, 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

multidimensional scalingexperimentsstochastic gradient descentstress minimization

Mathematics Subject Classification ID

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

Cites Work

• The University of Florida sparse matrix collection
• Title not available (Why is that?)
• An algorithm for drawing general undirected graphs
• Drawing large graphs by multilevel maxent-stress optimization
• Constrained graph layout by stress majorization and gradient projection
• Graph Drawing
• A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
• An Experimental Study on Distance-Based Graph Drawing
• Untangling the hairballs of multi-centered, small-world online social media networks
• A sparse stress model
• More flexible radial layout

Cited In (2)

• Balancing between the local and global structures (LGS) in graph embedding
• Spherical graph drawing by multi-dimensional scaling

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014101)