DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY-Reference-Cited by-同舟云学术

DRAWING DIRECTED ACYCLIC GRAPHS: AN EXPERIMENTAL STUDY

Published:2000-12 Issue:06 Volume:10 Page:623-648
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

DI BATTISTA GIUSEPPE¹,GARG ASHIM²,LIOTTA GIUSEPPE³,PARISE ARMANDO⁴,TAMASSIA ROBERTO⁵,TASSINARI EMANUELE⁴,VARGIU FRANCESCO⁶,VISMARA LUCA⁵

Affiliation:

1. Dipartimento di Informatica e Automazione, Università degli Studi di Roma Tre Via della Vasca Navale 79, 00146 Roma, Italy

2. Department of Computer Science and Engineering, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14260–2000, USA

3. Dipartimento di Ingegneria Elettronica e dell'Informazione, Università degli Studi di Perugia Via Duranti 93, 06131 Perugia, Italy

4. Dipartimento di Informatica e Sistemistica, Università degli Studi di Roma "La Sapienza" Via Salaria 113, 00198 Roma, Italy

5. Center for Geometric Computing, Department of Computer Science, Brown University, 115 Waterman Street, Providence, RI 02912–1910, USA

6. Centro Tecnico per la Rete Unitaria Via Isonzo 21, 00198 Roma, Italy

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218195900000358

Reference20 articles.

1. Drawing graphs nicely using simulated annealing

2. Algorithms for drawing graphs: an annotated bibliography

3. An experimental comparison of four graph drawing algorithms

4. Area requirement and symmetry display of planar upward drawings

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Evaluating Graph Layout Algorithms: A Systematic Review of Methods and Best Practices;Computer Graphics Forum;2024-05-03

2. Constant-Time Reachability in DAGs Using Multidimensional Dominance Drawings;SN Computer Science;2021-06-04

3. Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics;Lecture Notes in Computer Science;2021

4. Inferring Partial Orders of Nodes for Hierarchical Network Layout;Journal of Imaging Science and Technology;2016-11-01

5. A Note on the Practicality of Maximal Planar Subgraph Algorithms;Lecture Notes in Computer Science;2016