Graph drawing algorithm engineering with AGD

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

Volumn 2269, Issue , 2002, Pages 307-323

  Gutwenger, Carsten ^a   Jünger, Michael ^b   Klau, Gunnar W ^c   Leipert, Sebastian ^a   Mutzel, Petra ^c  

^a CENTER OF ADVANCED EUROPEAN STUDIES AND RESEARCH CAESAR   (Germany)

^b UNIVERSITY OF COLOGNE   (Germany)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

VISUALIZATION;

ALGORITHM ENGINEERING; COMMON-BASE; GRAPH DRAWING; GRAPH DRAWING ALGORITHMS; HIERARCHICAL GRAPHS; SOFTWARE LIBRARIES;

DRAWING (GRAPHICS);

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

References (47)

1. AGD User Manual (Version 1.2), 2000. Max-Planck-Institut Saarbrücken, Technische Universität Wien, Universität zu Köln, Universität Trier. See also http://www.mpi-sb.mpg.de/AGD/.
2. S. Bridgeman, G. Di Battista, W. Didimo, G. Liotta, R. Tamassia, and L. Vismara. Turn-regularity and optimal area drawings for orthogonal representations. Computational Geometry Theory and Applications (CGTA), 2000. To appear.
3. C. Buchheim, M. Jünger, and S. Leipert. A fast layout algorithm for klevel graphs. In J. Marks, editor, Graph Drawing 2000, volume 1984 of LNCS, pages 229–240. Springer-Verlag, 2000.
4. C. Batini, E. Nardelli, and R. Tamassia. A layout algorithm for data-flow diagrams. IEEE Trans. Soft. Eng., SE-12(4):538–546, 1986.
5. C. Batini, M. Talamo, and R. Tamassia. Computer aided layout of entity relationship diagrams. J. Syst. and Softw., 4:163-173, 1984.
6. E. G. Coffman and R. L. Graham. Optimal scheduling for two processor systems. Acta Informatica, 1:200–213, 1972.
7. M. Chrobak and G. Kant. Convex grid drawings of 3-connected planar graphs. Internat. Journal on Computational Geometry and Applications, 7(3):211–224, 1997.
8. H. De Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41–51, 1990.
9. G. Di Battista and R. Tamassia. On-line planarity testing. SIAM J. Comput., 25(5):956–997, 1996.
10. G. Di Battista, R. Tamassia, and I. G. Tollis. Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom., 7:381–401, 1992.
11. P. Eades and D. Kelly. Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria, 21(A):89–98, 1986.
12. P. Eades and X. Lin. A new heuristic for the feedback arc set problem. Australian Journal of Combinatorics, 12:15–26, 1995.
13. P. Eades and P. Mutzel. Graph drawing algorithms. In M. Atallah, editor, CRC Handbook of Algorithms and Theory of Computation, chapter 9, pages 9–1–9–26. CRC Press, 1999.
14. P. Eades and N. Wormald. The median heuristic for drawing 2-layers networks. Technical Report 69, Dept. of Comp. Sci., University of Queensland, 1986.
15. S. Fialko. Das planare Augmentierungsproblem. Master’s thesis, Universit ät des Saarlandes, Saarbrücken, 1997.
16. U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F.J. Brandenburg, editor, Graph Drawing’95), volume 1027 of LNCS, pages 254–266. Springer, 1996.
17. S. Fialko and P. Mutzel. A new approximation algorithm for the planar augmentation problem. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’98), pages 260–269, San Francisco, California, 1998. ACM Press.
18. T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Softw. – Pract. Exp., 21(11):1129–1164, 1991.
19. Graph Drawing Toolkit: An object-oriented library for handling and drawing graphs. http://www.dia.uniroma3.it/˜gdt.
20. M. Grötschel, M. Jünger, and G. Reinelt. On the acyclic subgraph polytope. Mathematical Programming, 33:28–42, 1985.
21. E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., 19(3):214–230, 1993.
22. C. Gutwenger and P. Mutzel. Grid embedding of biconnected planar graphs. Extended Abstract, Max-Planck-Institut für Informatik, Saarbrücken, Germany, 1997.
23. C. Gutwenger and P. Mutzel. Planar polyline drawings with good angular resolution. In S. Whitesides, editor, Graph Drawing’98, volume 1547 of LNCS, pages 167–182. Springer-Verlag, 1998.
24. C. Gutwenger and P. Mutzel. A linear-time implementation of SPQRtrees. In J. Marks, editor, Graph Drawing 2000, volume 1984 of LNCS, pages 77–90. Springer-Verlag, 2000.
25. C. Gutwenger, P. Mutzel, and R. Weiskircher. Inserting an edge into a planar graph. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’2001), pages 246–255, Washington, DC, 2001. ACM Press.
26. N. Gelfand and R. Tamassia. Algorithmic patterns for orthogonal graph drawing. In S. Whitesides, editor, Graph Drawing’98, volume 1547 of LNCS, pages 138–152. Springer-Verlag, 1998.
27. M. Himsolt. GML: A portable graph file format. Technical report, Universit ät Passau, 1997. See also http://www.uni-passau.de/Graphlet/GML.
28. M. Jünger, S. Leipert, and P. Mutzel. A note on computing a maximal planar subgraph using PQ-trees. IEEE Trans. on Computer-Aided Design, 17(7), 1998.
29. M. Jünger and P. Mutzel. The polyhedral approach to the maximum planar subgraph problem: New chances for related problems. In DIMACS Graph Drawing’94, volume 894 of LNCS, pages 119–130. Springer-Verlag, 1994.
30. M. Jünger and P. Mutzel. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms and Applications (JGAA) (http://www.cs.brown.edu/publications/jgaa/), 1(1):1–25, 1996.
31. M. Jünger and P. Mutzel. Maximum planar subgraphs and nice embeddings: Practical layout tools. Algorithmica, 16(1):33–59, 1996.
32. M. Jünger and S. Thienel. The ABACUS system for branch-and-cut and price algorithms in integer programming and combinatorial optimization. Software – Practice and Experience, 30:1325–1352, 2000.
33. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, Special Issue on Graph Drawing, 16(1):4–32, 1996.
34. G. W. Klau, K. Klein, and P. Mutzel. An experimental comparison of orthogonal compaction algorithms. In Graph Drawing (Proc. 2000), LNCS. Springer Verlag, 2001.
35. G. Klau and P. Mutzel. Quasi-orthogonal drawing of planar graphs. Technical Report MPI-I-98-1-013, Max–Planck–Institut f. Informatik, Saarbrücken, 1998.
36. G. W. Klau and P. Mutzel. Optimal compaction of orthogonal grid drawings. In G. P. Cornuéjols, R. E. Burkard, and G. J. Woeginger, editors, Integer Programming and Combinatorial Optimization (IPCO’99), volume 1610 of LNCS, pages 304–319. Springer, 1999.
37. T. Lengauer. Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York, 1990.
38. K. Mehlhorn and S. Näher. The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press, 1999.
39. C. Matuszewski, R. Schönfeld, and P. Molitor. Using sifting for k-layer crossing minimization. In J. Kratochvil, editor, Graph Drawing’99, volume 1731 of LNCS, pages 217–224. Springer-Verlag, 1999.
40. P. Mutzel. A polyhedral approach to planar augmentation and related problems. In Paul Spirakis, editor, Annual European Symposium on Algorithms (ESA-3): Corfu, Greece, September 2 5-27, 1995; proceedings, volume 979 of LNCS, pages 494–507, Berlin, 1995. Springer.
41. E. Reingold and J. Tilford. Tidier drawing of trees. IEEE Trans. Softw. Eng., SE-7(2):223–228, 1981.
42. P. Rosenstiehl and R. E. Tarjan. Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete Comput. Geom., 1(4):343–353, 1986.
43. 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.
44. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421–444, 1987.
45. 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.
46. W. T. Tutte. How to draw a graph. Proceedings London Mathematical Society, 13(3):743–768, 1963.
47. J. Q. Walker II. A node-positioning algorithm for general trees. Software – Practice and Experiments, 20(7):685–705, 1990.