Graph Drawing via Gradient Descent, (GD)^2

DOI10.1007/978-3-030-68766-3_1MaRDI QIDQ5014098zbMATH OpenOpenAlexFDO

Authors Reyan Ahmed, Felice De Luca, Sabin Devkota, Stephen G. Kobourov, Mingwei Li

Publication date 1 December 2021

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• A multi-scale algorithm for drawing graphs nicely
• scientific article; zbMATH DE number 1974121
• Graph Drawing by High-Dimensional Embedding
• Drawing graphs with mathematical programming and variable neighborhood search
• scientific article; zbMATH DE number 1974120
• Variable neighborhood descent for the incremental graph drawing
• Graph Drawing
• Graph Drawing
• On Rectilinear Drawing of Graphs

Cites work

• A Geometric Heuristic for Rectilinear Crossing Minimization
• A greedy heuristic for crossing-angle maximization
• A heuristic approach towards drawings of graphs with high crossing resolution
• An algorithm for drawing general undirected graphs
• Drawing 3-polytopes with good vertex resolution
• Evaluating Derivatives
• Graph Drawing
• Graph Drawing via Gradient Descent, (GD)^2
• scientific article; zbMATH DE number 2084318 (Why is no real title available?)
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Shape-based quality metrics for large graph visualization
• Stress-Plus-X (SPX) graph layout
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
• The rectilinear crossing number of K_n: closing in (or are we?)
• The straight-line RAC drawing problem is NP-hard
• Thirty Essays on Geometric Graph Theory

Cited in

(5)

• Graph Drawing via Gradient Descent, (GD)^2
• Connected-closeness: A Visual Quantification of Distances in Network Layouts
• Visualizing evolving trees
• The perception of stress in graph drawings
• NNP-net: accelerating t-SNT graph drawing for very large graphs by neural networks

Describes a project that uses

Uses Software

• TensorFlow

This page was built for publication: Graph Drawing via Gradient Descent, $$(GD)^2$$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014098)