Experimental studies on graph drawing algorithms

Software - Practice and Experience

Volumn 30, Issue 11, 2000, Pages 1235-1284

  Vismara, Luca ^a   Di Battista, Giuseppe ^b   Garg, Ashim ^c   Liotta, Giuseppe ^d   Tamassia, Roberto ^a   Vargiu, Francesco ^e  

^a Brown Univerity   (United States)

^b ROMA TRE UNIVERSITY   (Italy)

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

^d UNIVERSITY OF PERUGIA   (Italy)

^e Centro Tecnico per la Rete Unitaria   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTER GRAPHICS; DATA STRUCTURES; GRAPH THEORY; INTERACTIVE COMPUTER SYSTEMS;

DIAGRAM LAYOUT; GRAPH DRAWING ALGORITHMS;

ALGORITHMS;

EID: 0034275819     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-024X(200009)30:11<1235::AID-SPE339>3.0.CO;2-B     Document Type: Article

References (84)

1. Di Battista G, Eades P, Tamassia R, Tollis IG. Algorithms for drawing graphs: An annotated bibliography. Comput. Geom. Theory Appl. 1994; 4(5):235-282.
2. Brandenburg FJ (ed.). Graph Drawing (Proceedings of GD '95) (Lecture Notes in Computer Science, vol. 1027). Springer-Verlag, 1996.
3. Di Battista G (ed.). Graph Drawing (Proceedings of GD '97) (Lecture Notes in Computer Science, vol. 1353). Springer-Verlag, 1997.
4. Di Battista G, Eades P, de Fraysseix H, Rosenstiehl P, Tamassia R (eds.). Graph Drawing '93 (Proceedings of the ALCOM International Workshop on Graph Drawing), 1993. http://www.cs.brown.edu/people/rt/gd-93.html.
5. North S (ed.). Graph Drawing (Proceedings of GD '96) (Lecture Notes in Computer Science, vol. 1190). Springer-Verlag, 1997.
6. Tamassia R, Tollis IG (eds.). Graph Drawing (Proceedings of GD '94) (Lecture Notes in Computer Science, vol. 894). Springer-Verlag, 1995.
7. Whitesides SH (ed.). Graph Drawing (Proceedings of GD '98) (Lecture Notes in Computer Science, vol. 1547) Springer-Verlag, 1998.
8. Cruz IF, Eades P (eds.). Special issue on graph visualization. J. Visual Lang. Comput. 1995; 6(3).
9. Di Battista G, Tamassia R (eds.). Special issue on graph drawing. Algorithmica 1996; 16(1).
10. Di Battista G, Tamassia R (eds.). Special issue on geometric representations of graphs. Comput. Geom. Theory Appl. 1998; 9(1-2).
11. Di Battista G, Eades P, Tamassia R, Tollis IG. Graph Drawing. Prentice Hall: Upper Saddle River, NJ, 1999.
12. Tamassia R, Di Battista G, Batini C. Automatic graph drawing and readability of diagrams. IEEE Trans. Syst. Man Cybern. 1988;SMC-18(1):61-79.
13. Purchase H. Which aesthetic has the greatest effect on human understanding? Graph Drawing (Proceedings of GD '97) (Lecture Notes in Computer Science, vol. 1353), Di Battista G (ed.). Springer-Verlag, 1997; 248-261.
14. Purchase HC, Cohen RF, James MI. An experimental study of the basis for graph drawing algorithms. ACM J. Experim. Algorithmics 1997; 2(4). http://www.jea.acm.org/1997/PurchaseDrawing/.
15. Johnson DS. A theoretician's guide to the experimental analysis of algorithms. Preliminary, partial draft, 1996; http://www.research.att.com/~dsj/papers/exper.ps.
16. Himsolt M. Comparing and evaluating layout algorithms within GraphEd. J. Visual Lang. Comput. 1995; 6(3):255-273. Special Issue on Graph Visualization, Cruz IF, Eades P (eds.).
17. Di Battista G, Garg A, Liotta G, Tamassia R, Tassinari E, Vargiu F. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl. 1997; 7(5-6):303-325.
18. Papakostas A, Six JM, Tollis IG. Experimental and theoretical results in interactive orthogonal graph drawing. Graph Drawing (Proceedings of GD '96) (Lecture Notes in Computer Science, vol. 1190), North S (ed.). Springer-Verlag, 1997; 371-386.
19. Papakostas A, Six JM, Tollis IG. Interactive orthogonal graph drawing: An experimental study. Technical Report UTDCS-3-99, Dept. Comput. Sci., Univ. Texas Dallas, May 1999.
20. Di Battista G, Garg A, Liotta G, Parise A, Tamassia R, Tassinari E, Vargiu F, Vismara L. Drawing directed acyclic graphs: An experimental study. Graph Drawing (Proceedings of GD '96) (Lecture Notes in Computer Science, vol. 1190), North S (ed.). Springer-Verlag, 1997; 76-91.
21. Di Battista G, Garg A, Liotta G, Parise A, Tamassia R, Tassinari E, Vargiu F, Vismara L. Drawing directed acyclic graphs: An experimental study. Int. J. Comput. Geom. Appl. to appear.
22. Jünger J, Mutzel P. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms Appl. 1997; 1(1): 1-25. http://www.cs.brown.edu/publications/jgaa/accepted/97/JuengerMutzel97.1.1.ps.gz.
23. Brandenburg FJ, Himsolt M, Rohrer C. An experimental comparison of force-directed and randomized graph drawing algorithms. Graph Drawing (Proceedings of GD '95) (Lecture Notes in Computer Science, vol. 1027), Brandenburg FJ (ed.). Springer-Verlag, 1996; 76-87.
24. Sugiyama K, Misue K. Graph drawing by the magnetic spring model. J. Visual Lang. Comput. 1995; 6(3):217-231. Special Issue on Graph Visualization, Cruz IF, Eades P (eds.).
25. Tamassia R, Tollis IG. Planar grid embedding in linear time. IEEE Trans. Circuits Syst. 1989; CAS-36(9):1230-1234.
26. Biedl TC, Kant G. A better heuristic for orthogonal graph drawings. Comput. Geom. Theory Appl. 1998; 9(3):159-180.
27. Tamassia R. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput. 1987; 16(3):421-444.
28. Papakostas A, Tollis IG. Improved algorithms and bounds for orthogonal drawings. Graph Drawing (Proceedings of GD '94) (Lecture Notes in Computer Science, vol. 894), Tamassia R, Tollis IG (eds.). Springer-Verlag, 1995; 40-51.
29. Papakostas A, Tollis IG. Algorithms for area-efficient orthogonal drawings. Comput. Geom. Theory Appl. 1998; 9(1-2):83-110. Special Issue on Geometric Representations of Graphs, Di Battista G, Tamassia R (eds.).
30. Papakostas A, Tollis IG. Interactive orthogonal graph drawing. IEEE Trans. Comput. 1998; C-47(11):1297-1309.
31. Sugiyama K, Tagawa S, Toda M. Methods for visual understanding of hierarchical systems. IEEE Trans. Syst. Man Cybern. 1981; SMC-11(2):109-125.
32. Eades P, Wormald NC. Edge crossings in drawings of bipartite graphs. Algorithmica 1994: 11(4):379-403.
33. Dresbach S. A new heuristic layout algorithm for DAGs. Operations Research Proceedings 1994, Derigs U, Bachem A, Drexl A (eds.). Springer-Verlag, 1994; 121-126.
34. Eades P, Kelly D. Heuristics for reducing crossings in 2-layered networks. Ars Combin. 1986; 21.A:89-98.
35. Catarci T. The assignment heuristic for crossing reduction. IEEE Trans. Syst. Man Cybern. 1995; SMC-25(3):515-521.
36. Koutsofios E, North S. Drawing graphs with dot. 1993. ftp://ftp.research.att.com/dist/drawdag/dotdoc.ps.Z.
37. Di Battista G, Pietrosanti E, Tamassia R, Tollis IG. Automatic layout of PERT diagrams with XPERT. Proceedings of the IEEE Workshop on Visual Languages (VL'89), 1989; 171-176.
38. Di Battista G, Tamassia R. Algorithms for plane representations of acyclic digraphs. Theoret. Comput. Sci. 1988; 61(2,3):175-198.
39. Di Battista G, Tamassia R, Tollis IG. Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom. 1992; 7(4):381-401.
40. Fruchterman T, Reingold E. Graph drawing by force-directed placement. Softw. - Pract. Exp. 1991; 21(11):1129-1164.
41. Kamada T, Kawai S. An algorithm for drawing general undirected graphs. Inform. Process. Lett. 1989; 31(1):7-15.
42. Davidson R, Harel D. Drawing graphs nicely using simulated annealing. ACM Trans. Graph. 1996; 15(4):301-331.
43. Tunkelang D. A practical approach to drawing undirected graphs. Technical Report CMU-CS-94-161, School Comput. Sci., Carnegie Mellon Univ., June 1994.
44. Frick A, Ludwig A, Mehldau H. A fast adaptive layout algorithm for undirected graphs. Graph Drawing (Proceedings of GD '94), (Lecture Notes in Computer Science, vol. 894). Tamassia R, Tollis IG (eds.). Springer-Verlag, 1995; 388-403.
45. Kant G. Algorithms for Drawing Planar Graphs. PhD Thesis, Dept. Comput. Sci., Univ. Utrecht, Utrecht, The Netherlands, 1993.
46. Trickey H. Drag: A graph drawing system. Proceedings of the International Conference on Electronic Publishing, 1988. Cambridge University Press, 171-182.
47. Di Battista G, Giammarco A, Santucci G, Tamassia R. The architecture of Diagram Server. Proceedings of the IEEE Workshop on Visual Languages, 1990; 60-65.
48. Di Battista G, Liotta G, Vargiu F. Diagram Server. J. Visual Lang. Comput. 1995; 6(3):275-298. Special Issue on Graph Visualization, Cruz IF, Eades P (eds.).
49. Garey MR, Johnson DS. Crossing number is NP-complete. SIAM J. Algebraic Discrete Methods 1983; 4(3):312-316.
50. Batini C, Furlani L, Nardelli E. What is a good diagram? A pragmatic approach. Proceedings of the 4th International Conference on the Entity-Relationship Approach, 1985; 312-319.
51. Batini C, Nardelli E, Tamassia R. A layout algorithm for data flow diagrams. IEEE Trans. Softw. Eng. 1986; SE-12(4):538-546.
52. Eades P, Lai W, Misue K, Sugiyama K. Preserving the mental map of a diagram. Proceedings of the 1st International Conference on Computational Graphics and Visualisation Techniques, 1991: 34-43.
53. Misue K, Eades P, Lai W, Sugiyama K. Layout adjustment and the mental map. J. Visual Lang. Comput. 1995; 6(2): 183-210.
54. Cohen RF, Di Battista G, Tamassia R, Tollis IG. Dynamic graph drawings: Trees, series-parallel digraphs, and planar st-digraphs. SIAM J. Comput. 1995; 24(5):970-1001.
55. Moen S. Drawing dynamic trees. IEEE Softw. 1990; 7(4):21-28.
56. Reingold E, Tilford J. Tidier drawing of trees. IEEE Trans. Softw. Eng. 1981; SE-7(2):223-228.
57. Newbery Paulish F, Tichy WF. EDGE: An extendible graph editor. Softw. - Pract. Exp. 1990; 20(S1):63-88.
58. Bohringer K, Newbery Paulish F. Using constraints to achieve stability in automatic graph layout algorithms. Proceedings of the ACM Conference on Human Factors in Computing Systems, 1990; 43-51.
59. North S. Incremental layout in DynaDAG. Graph Drawing (Proceedings of GD '95) (Lecture Notes in Computer Science, vol. 1027), Brandenburg FJ (ed.). Springer-Verlag, 1996; 409-418.
60. Miriyala K, Hornick SW, Tamassia R. An incremental approach to aesthetic graph layout. Proceedings of the 6th International Workshop on Computer-Aided Software Engineering. IEEE Computer Society, 1993; 297-308.
61. Biedl TC, Kaufmann M. Area-efficient static and incremental graph drawings. Algorithms (Proceedings of ESA'97) (Lecture Notes in Computer Science, vol. 1284), Burkard R, Woeginger G (eds.). Springer-Verlag, 1997; 37-52.
62. Bridgeman SS, Fanto J, Garg A, Tamassia R, Vismara L. InteractiveGiotto: An algorithm for interactive orthogonal graph drawing. Graph Drawing (Proceedings of GD '97) (Lecture Notes in Computer Science, vol. 1353), Di Battista G (ed.). Springer-Verlag, 1997; 303-308.
63. Brandes U, Wagner D. A bayesian paradigm for dynamic graph layout. Graph Drawing (Proceedings of GD '97) (Lecture Notes in Computer Science, vol. 1353), Di Battista G (ed.). Springer-Verlag, 1997; 236-247.
64. Eades P. A heuristic for graph drawing. Congr. Numer. 1984; 42:149-160.
65. Madden B, Madden P, Powers S, Himsolt M. Portable graph layout and editing. Graph Drawing (Proceedings of GD '95) (Lecture Notes in Computer Science, vol. 1027), Brandenburg FJ (ed.). Springer-Verlag, 1996; 385-395.
66. Frick A. Upper bounds on the number of hidden nodes in Sugiyama's algorithm. Graph Drawing (Proceedings of GD '96) (Lecture Notes in Computer Science, vol. 1190), North S (ed.). Springer-Verlag, 1997; 169-183.
67. Eades P, McKay B, Wormald NC. On an edge crossing problem. Proceedings of the 9th Australian Computer Science Conference, 1986; 327-334.
68. Mäkinen E. Experiments on drawing 2-level hierarchical graphs. Int. J. Comput. Math. 1990; 36(3+4):175-181.
69. Mutzel P. An alternative method to crossing minimization on hierarchical graphs. Graph Drawing (Proceedings of GD '96) (Lecture Notes in Computer Science, vol. 1190), North S (ed.). Springer-Verlag, 1997; 318-333.
70. Mutzel P, Weiskircher R. Two-layer planarization in graph drawing. Algorithms and Computation (Proceedings of ISAAC'98) (Lecture Notes in Computer Science, vol. 1533), Chwa K-Y, Ibarra OH (eds.). Springer-Verlag, 1998; 69-78.
71. Jünger M, Lee EK, Mutzel P, Odenthal T. A polyhedral approach to the multi-layer crossing minimization problem. Graph Drawing (Proceedings of GD '97) (Lecture Notes in Computer Science, vol. 1353), Di Battista G, (ed.) Springer-Verlag, 1997; 13-24.
72. Gansner ER, Koutsofios E, North SC, Vo KP. A technique for drawing directed graphs. IEEE Trans. Softw. Eng. 1993; SE-19(3):214-230.
73. Gansner ER, North S, Vo KP. DAG - A program that draws directed graphs. Softw. Pract. Exp. 1988; 18(11):1047-1062.
74. Buti L, Di Battista G, Liotta G, Tassinari E, Vargiu F, Vismara L. GD-Workbench: A system for prototyping and testing graph drawing algorithms. Graph Drawing (Proceedings of GD '95) (Lecture Notes in Computer Science, vol. 1027), Brandenburg FJ (ed.). Springer-Verlag, 1996; 111-122.
75. Rosenstiehl P, Tarjan RE. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom. 1986; 1(4):343-353.
76. Tamassia R, Tollis IG. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1986; 1(4):321-341.
77. Di Battista G, Tamassia R, Tollis IG. Constrained visibility representations of graphs. Inform. Process. Lett. 1992; 41(1):1-7.
78. Garg A, Tamassia R. Upward planarity testing. Order 1995; 12(2): 109-133.
79. Rival I. Reading, drawing, and order. Algebras and Orders, Rosenberg IG, Sabidussi G (eds.). Kluwer Academic Publishers, 1993; 359-104.
80. Bertolazzi P, Cohen RF, Di Battista G, Tamassia R, Tollis IG. How to draw a series-parallel digraph. Int. J. Comput. Geom. Appl. 1994; 4(4):385-402.
81. Chrobak M, Goodrich MT, Tamassia R. Convex drawings of graphs in two and three dimensions. Proceedings of the 12th Annual ACM Symposium Comput. Geom., 1996; 319-328.
82. Garg A, Tamassia R. Planar drawings and angular resolution: Algorithms and bounds. Algorithms (Proceedings of ESA '94) (Lecture Notes in Computer Science, vol. 855), van Leeuwen J (ed.). Springer-Verlag, 1994; 12-23.
83. North S. 5114 directed graphs, 1995. ftp://ftp.research.att.com/dist/drawdag/dg.gz.
84. Himsolt M. GraphEd: A graphical platform for the implementation of graph algorithms. Graph Drawing (Proceedings of GD '94) (Lecture Notes in Computer Science, vol. 894), Tamassia R, Tollis IG (eds.). Springer-Verlag, 1995; 182-193.