Taurus: Towards a Unified Force Representation and Universal Solver for Graph Layout
Mingliang Xue, Zhi Wang, Fahai Zhong, Yong Wang, Mingliang Xu, Oliver Deussen, Yunhai Wang
Abstract
Over the past few decades, a large number of graph layout techniques have been proposed for visualizing graphs from various domains. In this paper, we present a general framework, Taurus, for unifying popular techniques such as the spring-electrical model, stress model, and maxent-stress model. It is based on a unified force representation, which formulates most existing techniques as a combination of quotient-based forces that combine power functions of graph-theoretical and Euclidean distances. This representation enables us to compare the strengths and weaknesses of existing techniques, while facilitating the development of new methods. Based on this, we propose a new balanced stress model (BSM) that is able to layout graphs in superior quality. In addition, we introduce a universal augmented stochastic gradient descent (SGD) optimizer that efficiently finds proper solutions for all layout techniques. To demonstrate the power of our framework, we conduct a comprehensive evaluation of existing techniques on a large number of synthetic and real graphs. We release an open-source package, which facilitates easy comparison of different graph layout methods for any graph input as well as effectively creating customized graph layout techniques.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get a74284c4-2dff-46fe-88ac-08dcc4a4f4f7Cited by top-tier papers1
Ask how each one uses itRelated papers
- CoRe-GD: A Hierarchical Framework for Scalable Graph Visualization with GNNsFlorian Grötschla, Joël Mathys, Robert Veres, Roger WattenhoferICLR 2024 · 10 citations
- DRGraph: An Efficient Graph Layout Algorithm for Large-scale Graphs by Dimensionality ReductionMinfeng Zhu, Wei Chen, Yuanzhe Hu, Yuxuan Hou et al.IEEE VIS 2020 · 45 citations
- Improved Visual Saliency of Graph Clusters with Orderable Node-Link LayoutsNora Al-Naami, Nicolas Médoc, Matteo Magnani, Mohammad GhoniemIEEE VIS 2024 · 8 citations
- Graph Traversal with Tensor Functionals: A Meta-Algorithm for Scalable LearningElan Sopher Markowitz, Keshav Balasubramanian, Mehrnoosh Mirtaheri, Sami Abu-El-Haija et al.ICLR 2021 · 23 citations
- Efficient Graph Query Processing over Geo-Distributed DatacentersYe Yuan, Delong Ma, Zhenyu Wen, Yuliang Ma et al.SIGIR 2020 · 11 citations
