An experimental comparison of four graph drawing algorithms
Giuseppe Di Battista,Ashim Garg,Giuseppe Liotta,Roberto Tamassia,Emanuele Tassinari,Francesco Vargiu +5 more
204
TL;DR: An extensive experimental study comparing four general-purpose graph drawing algorithms, which take as input general graphs and construct orthogonal grid drawings, which are widely used in software and database visualization applications.
read more
Abstract: In this paper we present an extensive experimental study comparing four general-purpose graph drawing algorithms. The four algorithms take as input general graphs (with no restrictions whatsoever on connectivity, planarity, etc.) and construct orthogonal grid drawings, which are widely used in software and database visualization applications. The test data (available by anonymous ftp) are 11,582 graphs, ranging from 10 to 100 vertices, which have been generated from a core set of 112 graphs used in “real-life” software engineering and database applications. The experiments provide a detailed quantitative evaluation of the performance of the four algorithms, and show that they exhibit trade-offs between “aesthetic” properties (e.g., crossings, bends, edge length) and running time.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Sync-and-Burst: Force-Directed Graph Drawing with Uniform Force Magnitudes.
TL;DR: A force-directed algorithm, called Sync-and-Burst, which falls into the category of classical force- directed graph drawing algorithms, and it is demonstrated that aesthetically pleasing layouts are achieved in O(n) iterations.
•Posted Content
Orthogonal Compaction Using Additional Bends
TL;DR: In this article, a one-dimensional compaction algorithm that alters the orthogonal shape of edges for better geometric results is presented, which can reduce the total edge length and the drawing area, but at the expense of additional bends.
Strong SDP based bounds on the cutwidth of a graph
10 Jan 2023
TL;DR: In this article , the authors present a semidefinite relaxation to approximate the cutwidth of a given graph, and identify several classes of valid inequalities and equalities that are used to strengthen the relaxation.
Quality Metrics and Reordering Strategies for Revealing Patterns in BioFabric Visualizations
Johannes Fuchs,Alexander Frings,Maria-Viktoria Heinle,Daniel A. Keim,Sara Di Bartolomeo +4 more
TL;DR: This paper explores quality metrics and reordering strategies for BioFabric visualizations, revealing that edge order has a stronger influence on pattern visibility than node layout, and proposes a combination of barycentric node layout and edge order based on node indices and length for optimal pattern revelation.
Optimieren über alle kombinatorischen Einbettungen eines planaren Graphen
Petra Mutzel,René Weiskircher +1 more
- 01 Jan 1999
TL;DR: Nach einer kurzen Ubersicht uber das Graduiertenkolleg „Effizienz and Komplexitat of Algorithmen and Rechenanlagen“ an der Universitat des Saarlandes, betrachten wir das Problem uber alle kombinatorische Einbettungen eines planaren Graphen zu optimieren.
References
Graph drawing by force-directed placement
TL;DR: A modification of the spring‐embedder model of Eades for drawing undirected graphs with straight edges is presented, developed in analogy to forces in natural systems, for a simple, elegant, conceptually‐intuitive, and efficient algorithm.
Methods for Visual Understanding of Hierarchical System Structures
Kozo Sugiyama,Shojiro Tagawa,Mitsuhiko Toda +2 more
- 01 Feb 1981
TL;DR: Two kinds of new methods are developed to obtain effective representations of hierarchies automatically: theoretical and heuristic methods that determine the positions of vertices in two steps to improve the readability of drawings.
1.4K
Efficient Planarity Testing
TL;DR: An efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane is described, which used depth-first search and has time and space bounds.
How to Draw a Graph
TL;DR: In this paper, the authors define nodally 3-connected graphs as simple and non-separable graphs, and show how to obtain a convex representation of such graphs without Kuratowski subgraphs.