Drawing Directed Acyclic Graphs: An Experimental Study.
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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 01, 1996
- Accession Number
- ADA318620
Entities
People
- A. Garg
- A. Parise
- G. Di Battista
- G. Liotta
- R. Tamassia
Organizations
- Brown University