Spherical graph drawing by multi-dimensional scaling
From MaRDI portal
Publication:6117037
DOI10.1007/978-3-031-22203-0_7arXiv2209.00191MaRDI QIDQ6117037
Stephen G. Kobourov, Vahan Huroyan, Jacob Miller
Publication date: 16 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.00191
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Metric embedding, hyperbolic space, and social networks
- An algorithm for drawing general undirected graphs
- Limitations on realistic hyperbolic graph drawing
- Why random reshuffling beats stochastic gradient descent
- The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- The university of Florida sparse matrix collection
- Large-Scale Machine Learning with Stochastic Gradient Descent
- Stochastic Gradient Descent Works Really Well for Stress Minimization
- Scale Space and PDE Methods in Computer Vision
- Graph Drawing
- A Stochastic Approximation Method
This page was built for publication: Spherical graph drawing by multi-dimensional scaling