An Experimental Study on Distance-Based Graph Drawing

DOI10.1007/978-3-642-00219-9_21zbMath1213.68429OpenAlexW1590611232MaRDI QIDQ3611854

Ulrik Brandes, Christian Pich

Publication date: 3 March 2009

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00219-9_21

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (12)

Deep neural network for drawing networks, \({(DNN)^{ 2 }} \) ⋮ A Quantitative Comparison of Stress-Minimization Approaches for Offline Dynamic Graph Drawing ⋮ An improved force-directed graph layout algorithm based on aesthetic criteria ⋮ Connected-closeness: A Visual Quantification of Distances in Network Layouts ⋮ FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing ⋮ A Sparse Stress Model ⋮ A quality metric for visualization of clusters in graphs ⋮ Crossing numbers and stress of random graphs ⋮ Data-driven graph drawing techniques with applications for conveyor systems ⋮ Solving Distance Geometry Problem with Inexact Distances in Integer Plane ⋮ Stochastic Gradient Descent Works Really Well for Stress Minimization ⋮ New Quality Metrics for Dynamic Graph Drawing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Visualization methodology for multidimensional scaling
• Fixed edge-length graph drawing is NP-hard
• An algorithm for drawing general undirected graphs
• Modern multidimensional scaling. Theory and applications.
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
• SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
• Graph Drawing
• Graph Drawing

This page was built for publication: An Experimental Study on Distance-Based Graph Drawing