Abstract
In this paper we consider the class of directed acyclic graphs (DAGs), and present the results of an experimental study on four drawing algorithms specifically developed for DAGs. Our study is conducted on two large test suites of DAGs and yields more than 30 charts comparing the performance of the drawing algorithms with respect to several quality measures, including area, crossings, bends, and aspect ratio. The algorithms exhibit various trade-offs with respect to the quality measures, and none of them clearly outperforms the others.
Cite
CITATION STYLE
Di Battista, G., Garg, A., Liotta, G., Parise, A., Tamassia, R., Tassinari, E., … Vismara, L. (1997). Drawing directed acyclic graphs: An experimental study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1190, pp. 76–91). Springer Verlag. https://doi.org/10.1007/3-540-62495-3_39
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
