An Experimental Study on Distance-Based Graph Drawing

DOI10.1007/978-3-642-00219-9_21MaRDI QIDQ3611854zbMATH OpenOpenAlexFDO

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

Recommendations

• scientific article; zbMATH DE number 1858605
• Drawing directed acyclic graphs: an experimental study
• An experimental comparison of four graph drawing algorithms.
• Graph Drawing
• Distance labeling in graphs (extended abstract)
• A User Study in Similarity Measures for Graph Drawing
• scientific article; zbMATH DE number 2080083

Cites work

• scientific article; zbMATH DE number 1693556 (Why is no real title available?)
• scientific article; zbMATH DE number 3579883 (Why is no real title available?)
• scientific article; zbMATH DE number 3605829 (Why is no real title available?)
• scientific article; zbMATH DE number 1974121 (Why is no real title available?)
• scientific article; zbMATH DE number 2080101 (Why is no real title available?)
• An algorithm for drawing general undirected graphs
• Eigensolver Methods for Progressive Multidimensional Scaling of Large Data
• Fixed edge-length graph drawing is NP-hard
• Graph Drawing
• Graph Drawing
• Modern multidimensional scaling. Theory and applications.
• Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
• Multidimensional scaling.
• SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
• Visualization methodology for multidimensional scaling

Cited in

(17)

• Crossing numbers and stress of random graphs
• Solving distance geometry problem with inexact distances in integer plane
• scientific article; zbMATH DE number 1858605 (Why is no real title available?)
• Connected-closeness: A Visual Quantification of Distances in Network Layouts
• Visualizing large graphs
• Stochastic Gradient Descent Works Really Well for Stress Minimization
• Deep neural network for drawing networks, \({(DNN)^{ 2 }} \)
• New Quality Metrics for Dynamic Graph Drawing
• A healthy critical attitude: revisiting the results of a graph drawing study
• Sketched graph drawing: a lesson in empirical studies
• An improved force-directed graph layout algorithm based on aesthetic criteria
• A quantitative comparison of stress-minimization approaches for offline dynamic graph drawing
• The perception of stress in graph drawings
• FORBID: Fast Overlap Removal By stochastic gradIent Descent for graph drawing
• A sparse stress model
• A quality metric for visualization of clusters in graphs
• Data-driven graph drawing techniques with applications for conveyor systems

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

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