Drawing directed acyclic graphs: An experimental study

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1190, Issue , 1997, Pages 76-91

  Di Battista, Giuseppe ^a   Garg, Ashim ^b   Liotta, Giuseppe ^b   Parise, Armando ^c   Tamassia, Roberto ^b   Tassinari, Emanuele ^c   Vargiu, Francesco ^d   Vismara, Luca ^b  

^a ROMA TRE UNIVERSITY   (Italy)

^b Brown Univerity   (United States)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

^d Autoritk per Plnformatica nella Pubbliea Amministrazione ^*  (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ASPECT RATIO; DRAWING (GRAPHICS); ECONOMIC AND SOCIAL EFFECTS; GRAPH THEORY;

DIRECTED ACYCLIC GRAPH (DAG); DIRECTED ACYCLIC GRAPHS; DRAWING ALGORITHMS; QUALITY MEASURES; TRADE OFF;

DIRECTED GRAPHS;

EID: 0342399933     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62495-3_39     Document Type: Conference Paper

References (25)

1. P. Bertolazzi, R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. How to draw a series-parallel digraph. Internat. Y. Comput. Geom. Appl., 4:385-402, 1994.
2. F. J. Brandenburg, M. Himsolt, and C. Rohrer. An experimental comparison of force-directed and randomized graph drawing algorithms. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes in Computer Science, pages 76-87. Springer-Verlag, 1996.
3. L. Buti, G. Di Battista, G. Liotta, E. Tassinari, F. Vargiu, and L. Vismara. GD-Workbench: A system for prototyping and testing graph drawing algorithms. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of LNCS, pages 111-122. Springer-Verlag, 1996.
4. M. Chrobak, M. T. Goodrich, and R. Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Annuo ACM Sympos. Comput. Geom., pages 319-328, 1996.
5. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Comput. Geom. Theory AppL, 4:235-282, 1994.
6. G. Di Battista, A. Garg, G. Liotta, A. Parise, R. Tamassia, E. Tassinari, F. Vargiu, and L. Vismara. Drawing directed graphs: An experimental study. Technical Report CS-96-24, Center for Geometric Computing, Dept. Computer Science, Brown Univ., 1996. ftp://ftp.cs.brown.edu/pub/tochreports/96/cs96-24.ps.Z.
7. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of three graph drawing algorithms. In Proc. 11th Annu. ACM Sympos. Comput. Geom., pages 306-315, 1995.
8. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 1996 (to appear), http://www.cs.brown.edu/cgc/papars/dglttv-ecfgd-96.ps.gz.
9. G. Di Battista, E. Pietrosanti, R. Tamassia, and I. G. Tollis. Automatic layout of PERT diagrams with XPERT. In Proc. IEEE Workshop on Visual Languages (VL’89), pages 171-176, 1989.
10. G. Di Battista and R. Tamassia. Algorithms for plane representations of acycfie digraphs. Theoret. Comput. Sci., 61:175-198, 1988.
11. G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom., 7:381-401, 1992.
12. G. Di Battista, R. Tamassia, and I. G. Tollis. Constrained visibifity representations of graphs. Inform. Process. Lett., 41:1-7, 1992.
13. E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., 19:214-230, 1993.
14. E. R. Gansner, S. C. North, and K. P. Vo. DAG - A program that draws directed graphs. Softw. – Pract. Exp., 18(11):1047-1062, 1988.
15. A. Garg and R. Tamassia. Planar drawings and angular resolution: Algorithms and bounds. In J. van Leeuwen, editor, Algorithms (Proc. ESA ’94), volume 855 of Lecture Notes in Computer Science, pages 12-23. Springer-Verlag, 1994.
16. A. Garg and R. Tamassia. Upward planarity testing. Order, 12:109-133, 1995.
17. M. Himsolt. Comparing and evaluating layout algorithms within GraphEd. J. Visual Lang. Comput., 6(3), 1995. (Special Issue on Graph Visualization, I. F. Cruz and P. Eades, editors).
18. S. Jones, P. Eades, A. Moran, N. Ward, G. Delott, and R. Tamassia. A note on planar graph drawing algorithms. Technical Report 216, Department of Computer Science, University of Queensland, 1991.
19. M. Jünger and P. Mutzel. Exact and heuristic algorithms for 2-layer straightline crossing minimization. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD ’95), volume 1027 of Lecture Notes in Computer Science, pages 337-348. Springer-Verlag, 1996.
20. E. Koutsofios and S. North. Drawing graphs with dot, 1993. dot user’s manual. ftp://ftp.research.art.com/dist/drawdag/.
21. S. North. 5114 directed graphs, 1995. Manuscript. ftp://ftp.research.art.corn/dist/drawdag/.
22. I. Rival. Reading, drawing, and order. In I. G. Rosenberg and G. Sabidussi, editors, Algebras and Orders, pages 359-404. Kluwer Academic Publishers, 1993.
23. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern., SMC-11(2):109-125, 1981.
24. R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1(4):321-341, 1986.
25. R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. Circuits Syst., CAS-36(9):1230-1234, 1989.