Drawing Large Graphs by Multilevel Maxent-Stress Optimization

DOI10.1007/978-3-319-27261-0_3zbMath1471.68206arXiv1506.04383OpenAlexW828261558MaRDI QIDQ2959740

Henning Meyerhenke, Martin Nöllenburg, Christian Schulz

Publication date: 10 February 2017

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation methods and heuristics in mathematical programming (90C59) Parallel algorithms in computer science (68W10)

Related Items (7)

A Sparse Stress Model ⋮ Multi-level graph drawing using infomap clustering ⋮ Engineering a combinatorial Laplacian solver: lessons learned ⋮ Data-driven graph drawing techniques with applications for conveyor systems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Stochastic Gradient Descent Works Really Well for Stress Minimization

This page was built for publication: Drawing Large Graphs by Multilevel Maxent-Stress Optimization