Drawing directed acyclic graphs: An experimental study

International Journal of Computational Geometry and Applications

Volumn 10, Issue 6, 2000, Pages 623-648

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

^a ROMA TRE UNIVERSITY   (Italy)

^b the State University of New York   (United States)

^c UNIVERSITY OF PERUGIA   (Italy)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

^e Brown Univerity   (United States)

^f Centro Tecnico per la Rete Unitaria   (Italy)

Author keywords

Algorithms implementation; Experimental comparison of algorithms; Graph drawing; Hierarchical drawings

Indexed keywords

EID: 0034548954     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195900000358     Document Type: Article

References (40)

1. P. Bertolazzi, R. F. Cohen, G. Di Battista, R. Tamassia, and I. G. Tollis. How to draw a series-parallel digraph. Internat. J. Comput. Geom. Appl., 4(4):385-402, 1994.
2. F. J. Brandenburg, editor. Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci. Springer-Verlag, 1996.
3. 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 Comput. Sci., pages 76-87. Springer-Verlag, 1996.
4. 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 Lecture Notes Comput. Sci., pages 111-122. Springer-Verlag, 1996.
5. M. Chrobak, M. T. Goodrich, and R. Tamassia. Convex drawings of graphs in two and three dimensions. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 319-328, 1996.
6. R. Davidson and D. Harel. Drawing graphs nicely using simulated annealing. ACM Trans. Graph., 15(4):301-331, 1996.
7. G. Di Battista, editor. Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci. Springer-Verlag, 1997.
8. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: An annotated bibliography. Comput. Geom. Theory Appl., 4(5):235-282, 1994.
9. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
10. 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., 7(5-6):303-325, 1997.
11. 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, pages 171-176, 1989.
12. G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci., 61(2,3):175-198, 1988.
13. G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom., 7(4):381-401, 1992.
14. G. Di Battista, R. Tamassia, and I. G. Tollis. Constrained visibility representations of graphs. Inform. Process. Lett., 41(1):1-7, 1992.
15. T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Softw. - Pract. Exp., 21(11):1129-1164, 1991.
16. E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., SE-19(3):214-230, 1993.
17. E. R. Gansner, S. North, and K. P. Vo. DAG - A program that draws directed graphs. Softw. - Pract. Exp., 18(11):1047-1062, 1988.
18. A. Garg and R. Tamassia. Planar drawings and angular resolution: Algorithms and bounds. In J. van Leeuwen, editor, Algorithms - ESA '94, volume 855 of Lecture Notes Comput. Sci., pages 12-23. Springer-Verlag, 1994.
19. A. Garg and R. Tamassia. Upward planarity testing. Order, 12(2):109-133, 1995.
20. M. Himsolt. Comparing and evaluating layout algorithms within GraphEd. J. Visual Lang. Comput., 6(3):255-273, 1995. Special Issue on Graph Visualization, I. F. Cruz and P. Eades, editors.
21. 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.
22. M. Jünger and P. Mutzel. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica, 16(1):33-59, 1996. Special Issue on Graph Drawing, G. Di Battista and R. Tamassia, editors.
23. M. Jünger and P. Mutzel. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms Appl., 1(1):1-25, 1997. http://www.cs.brown.edu/publications/jgaa/accepted/97/JuengerMutze197.1. 1.ps.gz.
24. T. Kamada. Visualizing Abstract Objects and Relations. World Scientific Series Comput. Sci., 1989.
25. G. Kant. Algorithms for Drawing Planar Graphs. PhD thesis, Dept. Comput. Sci., Univ. Utrecht, Utrecht, The Netherlands, 1993.
26. E. Koutsofios and S. North. Drawing graphs with dot, 1993. ftp://ftp.research.att.com/dist/drawdag/dotdoc.ps.Z.
27. J. Kratochvíl, editor. Graph Drawing (Proc. GD '99), volume 1731 of Lecture Notes Comput. Sci. Springer-Verlag, 1999.
28. S. North. 5114 directed graphs, 1995. ftp://ftp.research.att.com/dist/drawdag/dg.gz.
29. S. North, editor. Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci. Springer-Verlag, 1997.
30. H. C. Purchase. Effective information visualisation: A study of graph drawing aesthetics and algorithms. Interact. Comput., 13(2):147-162, 2000.
31. H. C. Purchase, R. F. Cohen, and M. I. James. An experimental study of the basis for graph drawing algorithms. ACM J. Experim. Algorithmics, 2(4), 1997. http://www.jea.acm.org/1997/PurchaseDrawing/.
32. I. Rival. Reading, drawing, and order. In I. G. Rosenberg and G. Sabidussi, editors, Algebras and Orders, pages 359-404. Kluwer Academic Publishers, 1993.
33. P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom., 1(4):343-353, 1986.
34. 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.
35. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern., SMC-18(1):61-79, 1988.
36. R. Tamassia and I. G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1(4):321-341, 1986.
37. R. Tamassia and I. G. Tollis. Planar grid embedding in linear time. IEEE Trans. Circuits Syst., CAS-36(9):1230-1234, 1989.
38. R. Tamassia and I. G. Tollis, editors. Graph Drawing (Proc. GD '94), volume 894 of Lecture Notes Comput. Sci. Springer-Verlag, 1995.
39. C. Ware, D. Hui, and G. Franck. Visualizing object oriented software in three dimensions. In Proc. IBM Centre for Advanced Studies Conf., pages 612-620, 1993.
40. S. H. Whitesides, editor. Graph Drawing (Proc. GD '98), volume 1547 of Lecture Notes Comput. Sci. Springer-Verlag, 1998.