An experimental comparison of four graph drawing algorithms

Computational Geometry: Theory and Applications

Volumn 7, Issue 5-6, 1997, Pages 303-325

  Di Battista, Giuseppe ^a   Garg, Ashim ^b   Liotta, Giuseppe ^b   Tamassia, Roberto ^b   Tassinari, Emanuele ^c   Vargiu, Francesco ^c  

^a ROMA TRE UNIVERSITY   (Italy)

^b Brown Univerity   (United States)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

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

Indexed keywords

EID: 0000052807     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(96)00005-3     Document Type: Article

References (50)

1. C. Batini, S. Ceri and S.B. Navathe, Conceptual Database Design, an Entity-Relationship Approach (Benjamin/Cummings, Menlo Park, CA, 1992).
2. C. Batini, L. Furlani and E. Nardelli, What is a good diagram? A pragmatic approach, in: Proc. 4th Internat. Conf. on the Entity Relationship Approach (1985).
3. C. Batini, E. Nardelli and R. Tamassia, A layout algorithm for data-flow diagrams, IEEE Trans. Software Engrg. 12 (4) (1986) 538-546.
4. 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 Ann. ACM Sympos. Comput. Geom. (1995) 306-315.
5. P. Bertolazzi, G. Di Battista and G. Liotta, Parametric graph drawing, IEEE Trans. Software Engrg. 21 (8) (1995) 662-673.
6. T. Biedl and G. Kant, A better heuristic for orthogonal graph drawings, in: Proc. 2nd Annu. European Sympos. Algorithms (ESA '94), Lecture Notes in Computer Science 855 (Springer, Berlin, 1994) 24-35.
7. F.J. Brandenburg, M. Himsolt and C. Rohrer, An experimental comparison of force-directed and randomized graph drawing algorithms, in: Proc. Graph Drawing 1995, Lecture Notes in Computer Science 1027 (1996) 76-87.
8. N. Chiba, K. Onoguchi and T. Nishizeki, Drawing planar graphs nicely, Acta Inform. 22 (1985) 187-201.
9. M. Chrobak and T. Payne, A linear-time algorithm for drawing planar graphs, Inform. Process. Lett. 54 (1995) 241-246.
10. R.F. Cohen, P. Eades, T. Lin and F. Ruskey, Three-dimensional graph drawing, in: R. Tamassia and I.G. Tollis, eds., Graph Drawing (Proc. GD '94), Lecture Notes in Computer Science 894 (Springer, Berlin, 1995) 1-11.
11. R. Davidson and D. Harel, Drawing graphs nicely using simulated annealing, Technical Report, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot (1989).
12. H. de Fraysseix, J. Pach and R. Pollack, Small sets supporting Fary embeddings of planar graphs, in: Proc. 20th Ann. ACM Sympos. Theory Comput. (1988) 426-433.
13. G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Computational Geometry 4 (5) (1994) 235-282.
14. G. Di Battista, A. Giammarco, G. Santucci and R. Tamassia, The architecture of Diagram Server, in: Proc. IEEE Workshop on Visual Languages (VL '90) (1990) 60-65.
15. G. Di Battista, G. Liotta and F. Vargiu, Diagram Server, J. Visual Languages and Computing 6 (3) (1995) (Special issue on Graph Visualization, I.F. Cruz and P. Eades, eds.).
16. D. Dolev, F.T. Leighton and H. Trickey, Planar embedding of planar graphs, in: F.P. Preparata, ed., Advances in Computing Research, Vol. 2 (JAI Press, Greenwich, CT, 1985) 147-161.
17. T. Fruchterman and E. Reingold, Graph drawing by force-directed placement, Softw. - Pract. Exp. 21 (11) (1991) 1129-1164.
18. G. Gane and T. Sarson, Structured Systems Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1979).
19. E.R. Gansner, S.C. North and K.P. Vo, DAG - a program that draws directed graphs, Softw. - Pract. Exp. 18 (11) (1988) 1047-1062.
20. M. Himsolt, Comparing and evaluating layout algorithms within GraphEd, J. Visual Languages and Computing 6 (3) (1995) (Special issue on Graph Visualization, I.F. Cruz and P. Eades, eds.).
21. M. Himsolt, GraphEd: a graphical platform for the implementation of graph algorithms, in: R. Tamassia and I.G. Tollis, eds., Graph Drawing (Proc. GD '94), Lecture Notes in Computer Science 894 (Springer, Berlin, 1995) 182-193.
22. J. Hopcroft and R.E. Tarjan, Efficient planarity testing, J. ACM 21 (4) (1974) 549-568.
23. 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).
24. M. Jünger and P. Mutzel, Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica 16 (1) (1996) (Special issue on Graph Drawing, G. Di Battista and R. Tamassia, eds.).
25. M. Jünger and P. Mutzel, The polyhedral approach to the maximum planar subgraph problem: New chances for related problems, in: R. Tamassia and I.G. Tollis, eds., Graph Drawing (Proc. GD '94), Lecture Notes in Computer Science 894 (Springer, Berlin, 1995) 119-130.
26. M. Jünger and P. Mutzel, Exact and heuristic algorithms for 2-layer straightline crossing minimization, in: Proc. Graph Drawing 1995, Lecture Notes in Computer Science 1027 (1996) 337-348.
27. T. Kamada, Visualizing Abstract Objects and Relations, World Scientific Series in Computer Science (1989).
28. T. Kamada and S. Kawai, An algorithm for drawing general undirected graphs, Inform. Process. Lett. 31 (1989) 7-15.
29. G. Kant, Algorithms for drawing planar graphs, Ph.D. Thesis, Dept. Comput. Sci., Univ. Utrecht, Utrecht, The Netherlands (1993).
30. G. Kant, A more compact visibility representation, in: Proc. 19th Internat. Workshop Graph-Theoret. Concepts Comput. Sci. (WG '93) (1993).
31. G. Kant and H.L. Bodlaender, Planar graph augmentation problems, in: Proc. 2nd Workshop Algorithms Data Struct., Lecture Notes in Computer Science 519 (Springer, Berlin, 1991) 286-298.
32. C.E. Leiserson, Area-efficient graph layouts (for VLSI), in: Proc. 21st Ann. IEEE Sympos. Found. Comput. Sci. (1980) 270-281.
33. E. Nardelli and M. Talamo, A fast algorithm for planarization of sparse diagrams, Technical Report R. 105, IASI-CNR, Rome (1984).
34. A. Papakostas and I.G. Tollis, Improved algorithms and bounds for orthogonal drawings, in: R. Tamassia and I.G. Tollis, eds., Graph Drawing (Proc. GD '94), Lecture Notes in Computer Science 894 (Springer, Berlin, 1995) 40-51.
35. A. Papakostas and I.G. Tollis, Improved algorithms and bounds for orthogonal drawings, Manuscript (1995).
36. R. Read, New methods for drawing a planar graph given the cyclic order of the edges at each vertex, Congr. Numer. 56 (1987) 31-44.
37. P. Rosenstiehl and R.E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs, Discrete Comput. Geom. 1 (4) (1986) 343-353.
38. K. Sugiyama, S. Tagawa and M. Toda, Methods for visual understanding of hierarchical systems, IEEE Trans. Systems Man Cybernet. 11 (2) (1981) 109-125.
39. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (3) (1987) 421-444.
40. R. Tamassia, G. Di Battista and C. Batini, Automatic graph drawing and readability of diagrams, IEEE Trans. Systems Man Cybernet. 18 (1) (1988) 61-79.
41. R. Tamassia and I.G. Tollis, A unified approach to visibility representations of planar graphs, Discrete Comput. Geom. 1 (4) (1986) 321-341.
42. R. Tamassia and I.G. Tollis, Planar grid embedding in linear time, IEEE Trans. Circuits Systems 36 (9) (1989) 1230-1234.
43. R. Tamassia and I.G. Tollis, eds., Graph Drawing (Proc. GD '94), Lecture Notes in Computer Science 894 (Springer, Berlin, 1995).
44. I.G. Tollis, Personal communication (1995).
45. H. Trickey, Drag: A graph drawing system, in: Proc. Internat. Conf. on Electronic Publishing (Cambridge University Press, 1988) 171-182.
46. W.T. Tutte, How to draw a graph, Proc. London Mathematical Society 13 (3) (1963) 743-768.
47. L. Valiant, Universality considerations in VLSI circuits, IEEE Trans. Comput. 30 (2) (1981) 135-140.
48. J.Q. Walker II, A node-positioning algorithm for general trees, Softw. - Pract. Exp. 20 (7) (1990) 685-705.
49. S.K. Wismath, Characterizing bar line-of-sight graphs, in: Proc. 1st Ann. ACM Sympos. Comput. Geom. (1985) 147-152.
50. D. Woods, Drawing planar graphs, Ph.D. Thesis, Department of Computer Science, Stanford University (1982), Technical Report STAN-CS-82-943.