Drawing Large Graphs by Multilevel Maxent-Stress Optimization

Drawing large graphs appropriately is an important step for the visual analysis of data from real-world networks. Here we present a novel multilevel algorithm to compute a graph layout with respect to the maxent-stress metric proposed by Gansner et al. (2013) that combines layout stress and entropy....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics Jg. 24; H. 5; S. 1814 - 1827
Hauptverfasser: Meyerhenke, Henning, Nollenburg, Martin, Schulz, Christian
Format: Journal Article
Sprache:Englisch
Veröffentlicht: United States IEEE 01.05.2018
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
algorithm engineering
Approximation algorithms
Computational modeling
Force
Graph layout
Graphs
Iterative methods
Layout
Layouts
Linear systems
Local optimization
Multilevel
multilevel algorithm
Optimization
Stress
ISSN:1077-2626, 1941-0506, 1941-0506
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Drawing large graphs appropriately is an important step for the visual analysis of data from real-world networks. Here we present a novel multilevel algorithm to compute a graph layout with respect to the maxent-stress metric proposed by Gansner et al. (2013) that combines layout stress and entropy. As opposed to previous work, we do not solve the resulting linear systems of the maxent-stress metric with a typical numerical solver. Instead we use a simple local iterative scheme within a multilevel approach. To accelerate local optimization, we approximate long-range forces and use shared-memory parallelism. Our experiments validate the high potential of our approach, which is particularly appealing for dynamic graphs. In comparison to the previously best maxent-stress optimizer, which is sequential, our parallel implementation is on average 30 times faster already for static graphs (and still faster if executed on a single thread) while producing a comparable solution quality.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:1077-2626
1941-0506
1941-0506
DOI:10.1109/TVCG.2017.2689016