Graph layout for applications in compiler construction

Theoretical Computer Science

Volumn 217, Issue 2, 1999, Pages 175-214

  Sander, G ^a,b  

^a Tom Sawyer Software   (United States)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

Compiler visualization; Compound drawing; Fisheye view; Force directed placement; Graph drawing; Graph layout; Hierarchical layout

Indexed keywords

EID: 0346246589     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00270-9     Document Type: Article

References (65)

1. G.S. Almasi, A. Gottlieb, Highly Parallel Computing, Benjamin/Cummings, Menlopark, CA, 1989.
2. M. Alt, U. Aßmann, H. Someren, Compiler phase embedding with the CoSy compiler model, in: P.A. Fritzson (Ed.), Compiler Construction, Proc. 5th Internat. Conf. CC'94, Lecture Notes in Computer Science, Vol. 786, Springer, Berlin 1994, pp. 278-293.
3. W. Bachl, F.J. Brandenburg, T. Hickl, Hierarchical graph design using HiGraD, Tech. Report MIP 9405, Fakultät Mathematik und Informatik, University of Passau. Germany, 1994.
4. C. Batini, E. Nardelli, R. Tamassia, A layout algorithm for data flow diagrams, IEEE Trans. Software Eng. SE-12(4), (1986) 538-546.
5. W. Boehm, H. Prautzsch, Numerical Methods, A.K. Peters, Vieweg, 1991.
6. F.J. Brandenburg, Designing graph drawings by layout graph grammars, in: R. Tamassia, I.G. Tollis (Eds.), Graph drawing, Proc. DIMACS Internat. Workshop GD'94, Lecture Notes in Computer Science, vol. 894, Springer, Berlin (1995). pp. 416-427.
7. F.J. Brandenburg,(Ed.), Proc. Symp. on Graph Drawing, GD'95, Lecture Notes in Computer Science, vol. 1027, Berlin, Springer, 1996.
8. F.J. Brandenburg, M. Himsolt, C. Rohrer, An experimental comparison of force-directed and randomized graph drawing algorithms, in: F.J. Brandenburg (Ed.), Proc. Symp. on Graph Drawing, GD'95, Lecture Notes in Computer Science, vol. 1027, Berlin, Springer, 1996. pp. 76-87.
9. T. Bräunl, Parallele Programmierung, Eine Einführung, Vieweg, Braunschreig, 1993.
10. M.J. Carpano, Automatic display of hierarchized graphs for computer aided decision analysis, IEEE Trans. Systems Man Cybernet. SMC 10(11) (1980) 705-715.
11. M.S.T. Carpendale, D.J. Cowperthwaite, F.D. Fracchia, T. Shermer, Graph folding: extending detail and context viewing into a tool for subgraph comparisons, in: F.J. Brandenburg (Ed.), Proc. Symp. on Graph Drawing, GD'95, Lecture Notes in Computer Science, vol. 1027, Berlin, Springer, 1996. pp. 127-139.
12. R. Davidson, D. Harel, Drawing graphs nicely using simulated annealing. Tech. Report CS89-13, Department of Applied Mathematics and Computer Science, The Weizmann Institute of Science, Rehovot, Israel, 1989.
13. P. Eades, A heuristic for graph drawing, Congr. Numer. 41 (1984) 149-160.
14. P. Eades, D. Kelly, Heuristics for reducing crossings in 2-layered networks, Ars Combin. 21-A (1986) 89-98.
15. P. Eades, K. Sugiyama, How to draw a directed graph, J. Inform. Process. 13 (4) (1990) 424-437.
16. P. Eades, N. Wormald, The median heuristic for drawing 2-layers networks, Tech. Report 69, Department of Computer Science, University of Queensland, 1986.
17. U. Fößmeier, M. Kaufmann, Drawing high degree graphs with low bend numbers, in: F.J. Brandenburg (Ed.), Proc. Symp. on Graph Drawing, GD'95, Lecture Notes in Computer Science, vol. 1027, Berlin, Springer, 1996. pp. 254-266.
18. A. Formella, J. Keller, Generalized fisheye views of graphs, in: F.J. Brandenburg, (Ed.), Proc. Symp. on Graph Drawing, GD'95, Lecture Notes in Computer Science, vol. 1027, Berlin Springer, 1996. pp. 254-266. pp. 242-253.
19. A. Frick, A. Ludwig, H. Mehldau, A fast adaptive layout algorithm for undirected graphs, in: R. Tamassia, I.G. Tollis (Eds.), Graph drawing, Proc. DIMACS Internat. Workshop GD'94, Lecture Notes in Computer Science, vol. 894, Springer, Berlin, 1995, pp. 388-403.
20. M. Fröhlich, M. Werner, Das interaktive graph visualisierungssytem daVinci V1.2, Tech. Report (in German), Fachbereich Mathematik und Informatik, University of Bremen, Germany, 1993.
21. T.M.J. Fruchterman, E.M. Reingold, Graph drawing by force-directed placement, Software - Practice and Experience 21 (1991) 1129-1164.
22. G.W. Furnas, Generalized fisheye views, Proc. ACM SIGCHI'86 Conf. on Human Factors in Computing Systems, 1986, pp. 16-23.
23. E.R. Gansner, E. Koutsofios, S.C. North, K.-P.Vo, A technique for drawing directed graphs, IEEE Trans. Software Eng. 19(3) (1993) 214-230.
24. M.R. Garey, D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman & Co., San Francisco, 1979.
25. M.R. Garey, D.S. Johnson, Crossing number is NP-complete, SIAM J. Algebraic Discrete Meth. 4(3) (1983) 312-316.
26. A. Garg, R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, Tech. Report CS-94-10, Department of Computer Science, Brown University, 1994.
27. T.R. Green, M. Petre, R.K.E. Bellamy, Comprehensibility of visual and textual programs: a test of superlativism against the match-mismatch conjecture, 4th Workshop on Empirical Studies of Programmers, 1991, pp. 121-146.
28. D. Harel, M. Sardas, Randomized graph drawing with heavy-duty preprocessing, Tech. Report CS93-16, Department of Applied Mathematics and Computer Science. The Weizmann Institute of Science, Rehovot, Israel, 1993.
29. T.R. Henry, Interactive graph layout: the exploration of large graphs, Ph.D. Thesis, TR 92-03, Department of Computer Science, The University of Arizona, 1992.
30. M. Himsolt, GraphEd - a graphical platform for the implementation of graph algorithms, in: R. Tamassia, I.G. Tollis (Eds.), Graph drawing. Proc. DIMACS Internat. Workshop GD'94, Lecture Notes in Computer Science, vol. 894, Springer, Berlin, 1995, pp. 182-193.
31. A. Hyrskykari, Development of program visualization systems, Report, Department of Computer Science, University of Tampere, Finland; Presented at the 2nd Czech British Symp. of Visual Aspects of Man-Machine Systems, Praha, 1993.
32. D. Johnson, The NP-completeness column: an ongoing guide, J. Algorithms 3(1) (1982) 215-218.
33. M. Jünger, P. Mutzel, Exact and heuristic algorithms for 2-layer straightline crossing minimization, in: F.J. Brandenburg, (Ed.), Proc. Symp. on Graph Drawing, GD'95, Lecture Notes in Computer Science, vol. 1027, Berlin Springer, 1996 pp. 337-348.
34. T. Kamada, S. Kawai, An algorithm for drawing general undirected graphs, Inform. Process. Lett. 31 (1989) 7-15.
35. K. Kaugars, J. Reinfels, A. Brazma, A simple algorithm for drawing large graphs on small screens, in: R. Tamassia, I.G. Tollis (Eds.) Graph drawing, Proc. DIMACS Intern. Workshop GD'94, Lecture Notes in Computer Science, 894, Springer, Berlin, 1995, pp. 278-281.
36. J.D. Mackinlay, G.G. Robertson, A.K. Card, The perspective wall: detail and context smoothly integrated, Proc. ACM SIGCHI'91 conf. on Human Factors in Computing Systems, 1991, pp. 173-179.
37. B. Madden, P. Madden, S. Powers, M. Himsolt, Portable graph layout and editing, in: F.J. Brandenburg, (Ed.), Proc. Symp. on Graph Drawing, GD'95, Lecture Notes in Computer Science, vol. 1027, Berlin Springer, 1996. pp. 385-395.
38. T. Masui, Graphic object layout with interactive genetic algorithms, Proc. IEEE Workshop on Visual Languages, 1992, pp. 74-80.
39. C.L. McCreary, F.S. Shieh, H. Gill, CG: a graph drawing system using graph grammar parsing, in: R. Tamassia, I.G. Tollis (Eds.) Graph Drawing, Proc. DIMACS Internat. Workshop GD'94, Lecture Notes in Computer Science 894, Springer, Berlin, 1995, pp. 270-273.
40. K. Mehlhorn, Data Structures and Algorithms, vol. 2: Graph Algorithms and NP-Completeness, Springer, Berlin, 1984.
41. K. Misue, K. Sugiyama, Multi-viewpoint perspective display methods: formulation and application to compound graphs, Human aspects in computing, in: H.J. Bullinger (Ed.), Proc. 4th Internat. Conf. on Human-Computer Interaction, Elsevier, 1991, pp. 834-838.
42. E.G. Noik, Layout-independent fisheye views of nested graphs, Proc. IEEE Symp. on Visual Languages, 1993, pp. 336-341.
43. F.N. Paulisch, W.F. Tichy, EDGE: an extendible graph editor, Software - Practice and Experience 20 (S1) (1990) 63-88.
44. D. Pazel, A graphical interface for evaluating a genetic algorithm for graph layout, Tech. Report RC 14348, IBM T.J. Watson Research Center, 1989.
45. L.B. Protsko, P.G. Sorenson, J.P. Tremblay, D.A. Schaefer, Towards the automatic generation of software diagrams, IEEE Trans. Software Eng. 17(1) (1991) 10-21.
46. N.R. Quinn Jr., M.A. Breuer, A force directed component placement procedure for printed circuit boards, IEEE Trans. Circuits Systems CAS-26(6) (1979) 377-388.
47. G. Sander, Graph layout through the VCG tool, Tech. Report A03-94, FB 14 Informatik, University of Saarbrücken, Germany, 1994,
48. an extended abstract is in: R. Tamassia, I.G. Tollis (Eds.), Graph drawing, Proc. DIMACS Internat. Workshop GD'94, Lecture Notes in Computer Science, vol. 894, Springer, Berlin (1995) pp. 194-205.
49. G. Sander, A fast heuristic for hierarchical manhattan layout, in: F.J. Brandenburg,(Ed.), Proc. Symp. on Graph Drawing, GD'95, Lecture Notes in Computer Science, vol. 1027, Berlin, Springer, 1996, pp. 447-458.
50. G. Sander, Visualisierungstechniken für den Compilerbau, Doctoral Thesis, University of Saarbrücken, Verlag Pirrot, Saarbrücken, Germany, 1996.
51. M. Sarkar, M.H. Brown, Graphical fisheye views, Commun. ACM 37 (12) (1994) 73-84.
52. A. Scott, A survey of graph drawing systems, Tech. Report 95-1 Department of Computer Science, University of Newcastle, Australia, 1995.
53. F.-S. Shieh, C.L. McCreary, Directed graphs drawing by clan-based decomposition, in: F.J. Brandenburg,(Ed.), Proc. Symp. on Graph Drawing, GD'95, Lecture Notes in Computer Science, vol. 1027, Berlin, Springer, 1996 pp. 472-482.
54. M.D. Storey, H.A. Müller, Graph layout adjustment strategies, in: F.J. Brandenburg (Ed.), Proc. Symp. on Graph Drawing, GD'95, Lecture Notes in Computer Science, vol. 1027, Berlin, Springer, 1996 pp. 487-499.
55. K. Sugiyama, K. Misue, Visualization of structural information: automatic drawing of compound digraphs, IEEE Trans. Systems Man Cybernet. 21 (4) (1991) 876-892.
56. K. Sugiyama, K. Misue, Graph drawing by magnetic-spring model, Research Report 1SIS-RR-94-14E, Inst. Social Information Science, Fujitsu Labs. Ltd., 1994.
57. K. Sugiyama, K. Misue, A simple and unified method for drawing graphs: magnetic-spring algorithm, in: R. Tamassia, I.G. Tollis (Eds.), Graph drawing, Proc. DIMACS Internat. Workshop GD'94, Lecture Notes in Computer Science, vol. 894, Springer, Berlin (1995) pp. 364-375.
58. K. Sugiyama, S. Tagawa, M. Toda, Methods for visual understanding of hierarchical systems, IEEE Trans. Systems Man Cybernet. SMC 11 (2) (1981) 109-125.
59. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16(3) (1987) 421-444.
60. R. Tamassia, I.G. Tollis, Planar grid embedding in linear time, IEEE Trans. Circuits Systems 36(9) (1989) 1230-1234.
61. R. Tamassia, I.G. Tollis (Eds.), Graph drawing, Proc. DIMACS Internat. Workshop GD'94, Lecture Notes in Computer Science, vol. 894, Springer, Berlin, 1995.
62. T. Tunkelang, An aesthetic layout algorithm for undirected graphs, Master's Thesis, MIT, 1992.
63. J.N. Warfield, Crossing theory and hierarchy mapping, IEEE Trans. Systems Man Cybernet. SMC 7(7) (1977) 505-523.
64. R. Wilhelm, D. Maurer, Compiler Design, Addison-Wesley, Reading, MA, 1995.
65. D.R. Woods, Drawing planar graphs, Tech. Report STAN-CS-82-943, Computer Science Department, Stanford University, 1982.