A fast successive over-relaxation algorithm for force-directed network graph drawing

DOI10.1007/s11432-011-4208-9zbMath1245.68148arXiv1711.01228MaRDI QIDQ439759

Zheng-Hua Wang, Yong-Xian Wang

Publication date: 17 August 2012

Published in: Science China. Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

graph drawing; force-directed algorithm; graph layout; successive over-relaxation

Mathematics Subject Classification ID

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

05C85: Graph algorithms (graph-theoretic aspects)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

Data-driven graph drawing techniques with applications for conveyor systems

Cites Work

• Unnamed Item
• Unnamed Item
• Convergence of the majorization method for multidimensional scaling
• Three-dimensional graph drawing
• Constrained graph layout by stress majorization and gradient projection
• An algorithm for drawing general undirected graphs
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Nonmetric multidimensional scaling. A numerical method
• Hybrid layout algorithm based on skeleton subgraph
• Integrating Edge Routing into Force-Directed Layout
• Iterative Solution of Nonlinear Equations in Several Variables
• Constrained Stress Majorization Using Diagonally Scaled Gradient Projection
• Graph Drawing
• Drawing graphs. Methods and models