Graphs in software visualization

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

Volumn 2269, Issue , 2002, Pages 285-294

  Mutzel, Petra ^a   Eades, Peter ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

SOFTWARE VISUALIZATION;

VISUALIZATION;

EID: 77954695839     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45875-1_22     Document Type: Conference Paper

References (56)

1. D. Auber. Tulip, a huge graphs visualization software. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 434–435. Springer-Verlag, 2002.
2. S. Bassil and R. K. Keller. Software visualization tools: Survey and analysis. In Proceedings of the Ninth InternationalWorkshop on Program Comprehension (IWPC’2001), pages 7–17, Toronto, ON, 2001. IEEE.
3. V. Batagelj and A. Mrvar. Pajek – program for large network analysis. Connection, 21(2):47–57, 1998.
4. V. Batagelj and A. Mrvar. Pajek - analysis and visualization of large networks. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 474–475. Springer-Verlag, 2002.
5. G. Di Battista, W. Didimo, and A. Marcandalli. Planarization of clustered graphs. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 60–74. Springer-Verlag, 2002.
6. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing. Prentice Hall, 1999.
7. F. Bertault. A force-directed algorithm that preserves edge crossing properties. In J. Kratochvíl, editor, Graph Drawing (Proc. GD’99), volume 1731 of Lecture Notes in Computer Science, pages 351–358. Springer-Verlag, 1999.
8. P. Bertolazzi, G. Di Battista, and W. Didimo. Computing orthogonal drawings with the minimum number of bends. In WADS’97, volume 1272 of Lecture Notes in Computer Science, pages 331–344, 1998.
9. F. Brandenburg and M. Himsolt. Graphlet. Available via “http://infosun.fmi.unipassau.de/Graphlet/”.
10. 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.
11. U. Brandes, M. Eiglsperger, I. Herman, M. Himsolt, and M. S. Marshall. GraphML progress report. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, page 497. Springer-Verlag, 2002.
12. S. S. Bridgeman, J. Fanto, A. Garg, R. Tamassia, and L. Vismara. Interactive giotto: An algorithm for interactive orthogonal graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD’97), volume 1353 of Lecture Notes in Computer Science, pages 303–308. Springer-Verlag, 1998.
13. E. G. Coffman and R. L. Graham. Optimal scheduling for two processor systems. Acta Informatica, 1:200–213, 1972.
14. J. Cohen. Drawing graphs to convey proximity: an incremental arrangement method. ACM Transactions on Computer-Human Interfaces, 4(11):197–229, 1997.
15. H.A.D. do Nascimento and P. Eades. User hints for directed graph drawing. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 203–217. Springer-Verlag, 2002.
16. T. Dwyer and P. Eckersley. Wilmascope interactive 3d graph visualisation system. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 440–441. Springer-Verlag, 2002.
17. P. Eades. A heuristic for graph drawing. Congr. Numer., 42:149–160, 1984.
18. Holger Eichelberger and Jürgen Wolff v. Gudenberg. On the Visualization of Java Programs. In Proceedings of DagstuhlSeminar on Software Visualization, 2001.
19. J. Ellson, E. Gansner, L. Koutsofios, S. North, and G. Woodhull. Graphviz - open source graph drawing tools. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 480–481. Springer-Verlag, 2002.
20. Alexander A. Evstiougov-Babaev. Call Graph and Control Flow Graph Visualization for Developers of Embedded Applications. In Proceedings of DagstuhlSeminar on Software Visualization, 2001.
21. U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD’95), volume 1027 of Lecture Notes in Computer Science, pages 254–266. Springer-Verlag, 1996.
22. E. Gansner, E. Koutsofios, S. North, and K. Vo. A technique for drawing directed graphs. In IEEE Transactions on Software Engineering, volume 19 (3), pages 214–229, 1993.
23. E. R. Gansner and S. C. North. Improved force-directed layouts. In S. H. Whitesides, editor, Graph Drawing (Proc. GD’99), volume 1547 of Lecture Notes in Computer Science, pages 364–373. Springer-Verlag, 1998.
24. P. Gayer, M. Goodrich, and S. Kobourov. A fast multi-dimensional algorithm for drawing large graphs. In J. Marks, editor, Graph Drawing (Proc. 2000), volume 1984 of Lecture Notes in Computer Science, pages 211–221. Springer-Verlag, 2001.
25. GDToolkit. http://www.dia.uniroma3.it/∼gdt.
26. C. Gutwenger, M. Jünger, K. Klein, J. Kupke, S. Leipert, and P. Mutzel. Automatic layout of uml class diagrams. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
27. C. Gutwenger, P. Mutzel, and R. Weiskircher. Inserting an edge into a planar graph. In Proceedings of the Ninth AnnualA CM-SIAM Symposium on Discrete Algorithms (SODA’2001), pages 246–255, Washington, DC, 2001. ACM Press.
28. Carsten Gutwenger, Michael Jünger, Gunnar Klau, Sebastian Leipert, and Petra Mutzel. Graph Drawing Algorithm Engineering with AGD. In Proceedings of DagstuhlSeminar on Software Visualization, 2001.
29. P. Healy and A. Kuusik. The vertex-exchange graph: a new concept for multilevel crossing minimization. In J. Kratochvíl, editor, Graph Drawing (Proc. GD’99), volume 1731 of Lecture Notes in Computer Science, pages 205–216. Springer- Verlag, 1999.
30. P. Healy and N. S. Nikolov. How to layer a directed acyclic graph. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 16–30. Springer-Verlag, 2002.
31. M. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs. In S. H. Whitesides, editor, Graph Drawing (Proc. GD’99), volume 1547 of Lecture Notes in Computer Science, pages 374–383. Springer- Verlag, 1998.
32. A. E. Jacobsen. Interaktion und Lernverfahren beim Zeichnen von Graphen mit Hilfe evolutionärer Algorithmen. Master’s thesis, Institut AIFB, Universität zu Karlsruhe, 76128 Karlsruhe, Germany, 2001.
33. M. Jünger and P. Mutzel. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications (JGAA) (http://www.cs.brown.edu/publications/jgaa/), 1(1):1–25, 1997.
34. M. Kaufmann and D. Wagner, editors. Drawing graphs: methods and models, volume 2025 of Lecture Notes in Computer Science Tutorial. Springer, 2001.
35. G. W. Klau, K. Klein, and P. Mutzel. An experimental comparison of orthogonal compaction algorithms. In Graph Drawing (Proc. 2000), LNCS. Springer Verlag, 2001.
36. G. W. Klau and P. Mutzel. Quasi–orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max–Planck–Institut für Informatik, Saarbrücken, 1998.
37. G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G. P. Cornuejols, editor, Integer Programming and CombinatorialOptimization (IPCO’99), Proceedings of the Seventh Conference, volume 1610 of Lecture Notes in Computer Science, pages 304–319. Springer-Verlag, 1999.
38. R. Koschke. Survey on software visualization for software maintenance, reengineering, and reverse engineering. www.informatik.uni-stuttgart.de/ifi/ps/rainer/softviz.
39. Rainer Koschke. Software Visualization for Reverse Engineering. In Proceedings of DagstuhlSeminar on Software Visualization, 2001.
40. D. Lütke-Hüttmann. Knickminimales zeichnen 4-planarer clustergraphen. Master’s thesis, Universit¨at des Saarlandes, Saarbrücken, Germany, 1999.
41. J. Marks, editor. Graph Drawing (Proc. GD 2000), volume 1984 of Lecture Notes in Computer Science. Springer-Verlag, 2001.
42. P. Mutzel. An alternative method to crossing minimization on hierarchical graphs. SIAM Journalon Optimization, 11(4):1065–1080, 2001.
43. P. Mutzel, M. Jünger, and S. Leipert, editors. Graph Drawing 2001, volume 2265 of Lecture Notes in Computer Science. Springer-Verlag, 2002.
44. P. Mutzel and R. Weiskircher. Bend minimization in orthogonal drawings via integer programming, 2001. submitted.
45. S. North and G. Woodhull. On-line hierarchical graph drawing. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 230–244. Springer-Verlag, 2002.
46. H. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Graph Drawing (Proc. GD’97), volume 1353 of Lecture Notes in Computer Science, pages 248–261. Springer-Verlag, 1997.
47. A. Quigley and P. Eades. Fade: Graph drawing, clustering, and visual abstraction. In J. Marks, editor, Graph Drawing (Proc. 2000), volume 1984 of Lecture Notes in Computer Science, pages 197–210. Springer-Verlag, 2001.
48. E. M. Reingold and Tilford. Tidier drawing of trees. IEEE Trans. Softw. Eng., SE-7(2):223–228, 1981.
49. K. Ryall. Glide. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 476–477. Springer-Verlag, 2002.
50. K. Sugiyama, editor. Graph drawing and applications for software and knowledge engineers. World Scientific, 2002. to appear
51. K. Sugiyama and K. Misue. Visualization of structural information: Automatic drawing of compound digraphs. IEEE Trans. Softw. Eng., 21(4):876–892, 1991.
52. 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.
53. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421–444, 1987.
54. C. Walshaw. A Multilevel Algorithm for Force-Directed Graph Drawing. In J. Marks, editor, Graph Drawing (Proc. 2000), volume 1984 of Lecture Notes in Computer Science, pages 171–182. Springer, 2001.
55. A. Winter. Exchanging graphs with GXL. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing (Proc. 2001), volume 2265 of Lecture Notes in Computer Science, pages 482–496. Springer-Verlag, 2002.
56. Andreas Winter, Bernt Kullbach, and Volker Riediger. An Overview of the GXL Graph Exchange Language. In Proceedings of DagstuhlSeminar on Software Visualization, 2001.