Stress-Plus-X (SPX) graph layout

DOI10.1007/978-3-030-35802-0_23OpenAlexW2991377000MaRDI QIDQ2206862

Katherine E. Isaacs, Felice De Luca, Sabin Devkota, Stephen G. Kobourov, Reyan Ahmed

Publication date: 26 October 2020

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

Mathematics Subject Classification ID

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

Related Items (2)

Stress-Plus-X (SPX) graph layout ⋮ Graph Drawing via Gradient Descent, $$(GD)^2$$

Cites Work

• Unnamed Item
• Unnamed Item
• A greedy heuristic for crossing-angle maximization
• An algorithm for drawing general undirected graphs
• Stress-Plus-X (SPX) graph layout
• The analysis of proximities: Multidimensional scaling with an unknown distance function: I, II
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• The Rectilinear Crossing Number of K n : Closing in (or Are We?)
• The Straight-Line RAC Drawing Problem Is NP-Hard
• A Geometric Heuristic for Rectilinear Crossing Minimization
• Local Multidimensional Scaling for Nonlinear Dimension Reduction, Graph Drawing, and Proximity Analysis
• Graph Drawing

This page was built for publication: Stress-Plus-X (SPX) graph layout