A Sparse Stress Model

DOI10.1007/978-3-319-50106-2_2zbMath1478.68256OpenAlexW2507855339MaRDI QIDQ2961500

Ulrik Brandes, Mark Ortmann, Mirza Klimenta

Publication date: 21 February 2017

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

Full work available at URL: http://nbn-resolving.de/urn:nbn:de:bsz:352-0-386011

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing ⋮ A quality metric for visualization of clusters in graphs ⋮ Drawing Dynamic Graphs Without Timeslices ⋮ Data-driven graph drawing techniques with applications for conveyor systems ⋮ New Quality Metrics for Dynamic Graph Drawing

Uses Software

• SparseMatrix

Cites Work

• Clustering large graphs via the singular value decomposition
• Modern multidimensional scaling. Theory and applications.
• COAST: A Convex Optimization Approach to Stress-Based Embedding
• Drawing Large Graphs by Multilevel Maxent-Stress Optimization
• The university of Florida sparse matrix collection
• Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
• An Experimental Study on Distance-Based Graph Drawing
• A Multilevel Algorithm for Force-Directed Graph-Drawing
• Graph Drawing by Classical Multidimensional Scaling: New Perspectives
• A Sparse Stress Model
• An r-Dimensional Quadratic Placement Algorithm
• Graph Drawing
• Graph Drawing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Sparse Stress Model