Journal Article10.1142/S0218195900000358
Drawing directed acyclic graphs: an experimental study
Giuseppe Di Battista,Ashim Garg,Giuseppe Liotta,Armando Parise,Roberto Tamassia,Emanuele Tassinari,Francesco Vargiu,Luca Vismara +7 more
34
TL;DR: The results of a comparative study on four popular drawing algorithms specifically developed for them are presented, and a new hybrid strategy for drawing DAGs is developed that performs quite well in practice.
read more
Abstract: In this paper we consider the important class of directed acyclic graphs (DAGs), and present the results of a comparative study on four popular drawing algorithms specifically developed for them. The study has been performed within a general experimental setting consisting of two large test suites of DAGs and a set of quality measures. The focus of the experiments has been the practical behavior of the algorithms with a geometric foundation compared to that of the algorithms with a topological foundation. The four algorithms exhibit various trade-offs with respect to the quality measures considered, and none of them clearly outperforms the others. Our analysis has motivated the development of a new hybrid strategy for drawing DAGs that performs quite well in practice.
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
•Journal Article
The Art and Science of Dynamic Network Visualization.
TL;DR: A framework for visualizing social networks and their dynamics is proposed, and a tool that enables debate and reflection on the quality of visualizations used in empirical research is presented.
196
•Proceedings Article
Hierarchical Drawing Algorithms.
Patrick Healy,Nikola S. Nikolov +1 more
- 01 Jan 2013
TL;DR: The University of Limerick 17.17.2018, Limerick, Ireland as discussed by the authors, Dublin, Ireland, United Kingdom, Ireland.Reference as discussed by the authors : http://www.universityof-limerick.edu.
72
Layer-free upward crossing minimization
TL;DR: This article presents a new approach for upward crossing minimization, that is, finding an upward drawing of a DAG G with as few crossings as possible, based on a two-stage upward planarization approach, which computes a feasible downward planar subgraph in the first step and reinserts the remaining arcs by computing constraint-feasible upward insertion paths.
34
•Proceedings Article
An SDP approach to multi-level crossing minimization
Markus Chimani,Philipp Hungerländer,Michael Jünger,Petra Mutzel +3 more
- 22 Jan 2011
TL;DR: In this paper, a semidefinite program (SDP) based approach was proposed to solve the multi-level crossing minimization problem, in which the graph's vertices are assigned to multiple parallel levels and the problem of ordering the nodes on their levels such that, when drawing the graph with straight lines, the resulting number of crossings is minimized.
31
Layer-free upward crossing minimization
Markus Chimani,Carsten Gutwenger,Petra Mutzel,Hoi-Ming Wong +3 more
- 30 May 2008
TL;DR: This paper presents a new approach for upward crossing minimization, i.e., finding an upward drawing of a DAG G with as few crossings as possible, based on a two-stage upward planarization approach, which computes a feasible downward planar subgraph in the first step and re-inserts the remaining edges by computing constraint-feasible upward insertion paths.
25
References
Algorithms for drawing graphs: an annotated bibliography
TL;DR: A bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs is presented, a first attempt to encompass both theoretical and application-oriented papers from disparate areas.
1K
A technique for drawing directed graphs
TL;DR: A four-pass algorithm for drawing directed graphs is presented, which creates good drawings and is fast.
808
Drawing graphs nicely using simulated annealing
Ron Davidson,David Harel +1 more
TL;DR: The paradigm of simulated annealing is applied to the problem of drawing graphs “nicely,” and the algorithm deals with general undirected graphs with straight-line edges, and employs several simple criteria for the aesthetic quality of the result.
Rectilinear planar layouts and bipolar orientations of planar graphs
TL;DR: This work proposes a linear-time algorithm, a variant of one by Otten and van Wijk, that generally produces a more compact layout than theirs and allows the dual of the graph to be laid out in an interlocking way.
An experimental comparison of four graph drawing algorithms
Giuseppe Di Battista,Ashim Garg,Giuseppe Liotta,Roberto Tamassia,Emanuele Tassinari,Francesco Vargiu +5 more
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.
206