Skip to main content
SpringerLink
Log in

AGD — A Library of Algorithms for Graph Drawing

  • Chapter
Graph Drawing Software

Part of the book series: Mathematics and Visualization ((MATHVISUAL))

Abstract

The development of the AGD software, an object-oriented C++ class library of Algorithms for Graph Drawing, has started in 1996. AGD is a general purpose Graph Drawing tool suited for beginners as well as for advanced users. It contains a variety of layout algorithms leading to different layout styles.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.ads.tuwien.ac.at/AGD/

    Google Scholar 

  2. Batini, C, Nardelli, E., Tamassia, R. (1986) A layout algorithm for data flow diagrams. IEEE Transactions on Software Engineering SE-12(4), 538–546

    Article  Google Scholar 

  3. Batini, C, Talamo, M., Tamassia, R. (1984) Computer aided layout of entity relationship diagrams. Journal of System and Software 4, 163–173

    Article  Google Scholar 

  4. Bridgeman, S., Di Battista, G., Didimo, W., Liotta, G., Tamassia, R., Vismara, L. (2000) Turn-regularity and optimal area drawings of orthogonal representations. Computational Geometry: Theory and Application 16(1), 53–93

    Article  MATH  Google Scholar 

  5. Buchheim, C, Jünger, M., Leipert, S. (2000) A fast layout algorithm for k-level graphs. In: J. Marks (ed.) Graph Drawing’ 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 229–240

    Google Scholar 

  6. Chrobak, M., Kant, G. (1997) Convex grid drawings of 3-connected planar graphs. International Journal of Computational Geometry and Applications 7(3), 211–224

    Article  MathSciNet  Google Scholar 

  7. Coffman, E. G., Graham, R. L. (1972) Optimal scheduling for two processor systems. Acta Informatica 1, 200–213

    Article  MathSciNet  Google Scholar 

  8. De Praysseix, H., Pach, J., Pollack, R. (1990) How to draw a planar graph on a grid. Combinatorica 10(1), 41–51

    Article  MathSciNet  Google Scholar 

  9. Di Battista, G., Tamassia, R. (1996) On-line planarity testing. SIAM Journal on Computing 25(5), 956–997

    Article  MathSciNet  MATH  Google Scholar 

  10. Di Battista, G., Tamassia, R., Tollis, I. G. (1992) Area requirement and symmetry display of planar upward drawings. Discrete and Computational Geometry 7, 381–401

    Article  MathSciNet  MATH  Google Scholar 

  11. Doorley, M. (1995) Automatic Levelling and Layout of Data Flow Diagrams. PhD thesis, University of Limerick, Ireland

    Google Scholar 

  12. Eades P., Kelly, D. (1986) Heuristics for reducing crossings in 2-layered networks. Ars Combinatoria 21(A), 89–98

    MathSciNet  Google Scholar 

  13. Eades, P., Lin, X. (1995) A new heuristic for the feedback arc set problem. Australian Journal of Combinatorics 12, 15–26

    MathSciNet  MATH  Google Scholar 

  14. Eades, P., Wormald, N. (1986) The median heuristic for drawing 2-layers networks. Technical Report 69, Department of Computer Science, University of Queensland

    Google Scholar 

  15. Eschbach, T., Günther, W., Drechsler, R., Becker, B. (2002) Crossing reduction by windows optimization. In: M. T. Goodrich and S. G. Kobourov (eds.) Graph Drawing’ 02, Lecture Notes in Computer Science 2528, Springer-Verlag, 285–294

    Google Scholar 

  16. Feng, Q. W., Cohen, R. F., Eades, P. (1995) Planarity for clustered graphs. In: P. Spirakis (ed.) Algorithms — ESA’ 95, Third Annual European Symposium, Lecture Notes in Computer Science 979, Springer-Verlag, 213–226

    Google Scholar 

  17. Fialko, S. (1997) Das planare Augmentierungsproblem. Master’s thesis, Universität des Saarlandes, Saarbrücken

    Google Scholar 

  18. Fialko, S., Mutzel, P. (1998) A new approximation algorithm for the planar augmentation problem. In: Proc. Ninth Annual ACM-SIAM Symp. Discrete Algorithms (SODA’ 98), San Francisco, California, ACM Press, 260–269

    Google Scholar 

  19. Fößmeier, U., Kaufmann, M. (1996) Drawing high degree graphs with low bend numbers. In: F. J. Brandenburg (ed.) Graph Drawing’ 95, Lecture Notes in Computer Science 1027, Springer-Verlag, 254–266

    Google Scholar 

  20. Fruchtermann, T. M. J., Reingold, E. M. (1991) Graph Drawing by force-directed placement. Software —actice and Experience 21, 1129–1164

    Article  Google Scholar 

  21. Gansner, E. R., Koutsofios, E., North, S. C, Vo, K. P. (1993) A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19, 214–230

    Article  Google Scholar 

  22. Graph Drawing Toolkit: An object-oriented library for handling and drawing graphs, http://www.dia.uniroma3.it/~gdt

    Google Scholar 

  23. Gelfand, N., Tamassia, R. (1998) Algorithmic patterns for orthogonal graph drawing. In: S. Whitesides (ed.) Graph Drawing’ 98, Lecture Notes in Computer Science 1547, Springer-Verlag, 138–152

    Google Scholar 

  24. Grötschel, M., Jünger, M., Reinelt, G. (1985) On the acyclic subgraph polytope. Mathematical Programming 33, 28–42

    Article  MathSciNet  MATH  Google Scholar 

  25. Gutwenger, C., Mutzel, P. (1997) Grid embedding of biconnected planar graphs. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Google Scholar 

  26. Gutwenger, C., Mutzel, P. (1998) Planar polyline drawings with good angular resolution. In: S. Whitesides (ed.) Graph Drawing’ 98, Lecture Notes in Computer Science 1547, Springer-Verlag, 167–182

    Google Scholar 

  27. Gutwenger, C, Mutzel, P. (2000) C. Gutwenger and P. Mutzel. A linear-time implementation of SPQR-trees. In: J. Marks (ed.) Graph Drawing’ 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 77–90

    Google Scholar 

  28. Gutwenger, C, Mutzel, P., Weiskircher, R. (2001) Inserting an edge into a planar graph. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’ 2001), Washington, DC, ACM Press, 246–255

    Google Scholar 

  29. Himsolt, M. (1997) GML: A portable graph file format. Technical report, Universität Passau, see also http://www.unipassau.de/Graphlet/GML

    Google Scholar 

  30. Jünger, M., Leipert, S., Mutzel, P. (1998) A note on computing a maximal planar subgraph using PQ-trees. IEEE Transactions of Computer-Aided Design and Integrated Circuits and Systems 17, 609–612

    Article  Google Scholar 

  31. Jünger, M., Mutzel, P. (1994) The polyhedral approach to the maximum planar subgraph problem: New chances for related problems. In: R. Tamassia and I. G. Tollis (eds.) Graph Drawing’ 94, Lecture Notes in Computer Science 894, Springer-Verlag, 119–130

    Google Scholar 

  32. Jünger, M., Mutzel, P. (1996) Maximum planar subgraphs and nice embeddings: practical layout tools. Algorithmica 16, 33–59

    Article  MathSciNet  MATH  Google Scholar 

  33. Jünger, M., Mutzel, P. (1997) 2-layer straight line crossing minimization: performance of exact and heuristic algorithms. Journal of Graph Algorithms and Applications 1, 1–25

    Article  MathSciNet  Google Scholar 

  34. Jünger, M., Mutzel, P. (2003) Automatic Graph Drawing: Exact optimization helps! To appear in: M. Grötschel (ed.) The Sharpest Cut — Festschrift zum 60. Geburtstag von Manfred Padberg, MPS-SIAM Series on Optimization

    Google Scholar 

  35. Jünger, M., Thienel, S. (2000) The ABACUS system for branch-and-cut and price algorithms in integer programming and combinatorial optimization. Software — Practice and Experience 30, 1325–1352

    Article  MATH  Google Scholar 

  36. Kant, G. (1996) Drawing planar graphs using the canonical ordering. Algorithmica, Special Issue on Graph Drawing 16(1), 4–32

    MathSciNet  MATH  Google Scholar 

  37. Klau, G. W. (1997) Quasi-orthogonales Zeichnen planarer Graphen mit wenigen Knicken. Master’s thesis, Universität des Saarlandes, Saarbrücken

    Google Scholar 

  38. Klau, G. W., Klein, K., Mutzel P. (2001) An Experimental Comparison of Orthogonal Compaction Algorithms. In: J. Marks (ed.) Graph Drawing’ 00, Lecture Notes in Computer Science 1984, Springer-Verlag, 37–51

    Google Scholar 

  39. Klau, G. W., Mutzel, P. (1998) Quasi-orthogonal drawing of planar graphs. Technical Report MPI-1-98-1-013, Max-Planck-Institut für Informatik, Saarbrücken

    Google Scholar 

  40. Klau, G. W., Mutzel P. (1999) Optimal compaction of orthogonal grid drawings. In: G. Cornuejols, R. E. Burkard, and G. J. Woeginger (eds.) Integer Programming and Combinatorial Optimization (IPCO’ 99), Lecture Notes in Computer Science 1610, Springer-Verlag, 304–319

    Google Scholar 

  41. Lengauer, T. (1990) Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, New York

    MATH  Google Scholar 

  42. Matuszewski, C, Schönfeld, R., Molitor, P. (1999) Using sifting for k-layer crossing minimization. In J. Kratochvil (ed.) Graph Drawing’ 99, Lecture Notes in Computer Science 1731, Springer-Verlag, 217–224

    Google Scholar 

  43. Mehlhorn, K., Näher, S. (1999) The LEDA Platform of Combinatorial and Geometric Computing. Cambridge University Press

    Google Scholar 

  44. Mutzel, P. (1995) A polyhedral approach to planar augmentation and related problems. In P. Spirakis (ed.) Algorithms — ESA’ 95, Third Annual European Symposium, Lecture Notes in Computer Science 979, Springer-Verlag, 494–507

    Google Scholar 

  45. Rauh, O., Stickel, E. (1997) Fallstudien zum Datenbankentwurf. Th. Gabler, Wiesbaden

    Google Scholar 

  46. Reingold, E., Tilford, J. (1981) Tidier drawing of trees. IEEE Transactions on Software Engineering 7, 223–228

    Article  Google Scholar 

  47. Rosenstiehl, P., Tarjan, R. E. (1986) Rectilinear planar layouts and bipolar orientations of planar graphs. Discrete and Computational Geometry 1(4), 343–353

    MathSciNet  MATH  Google Scholar 

  48. Sugiyama, K., Tagawa, S., Toda, M. (1981) Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11, 109–125

    Article  MathSciNet  Google Scholar 

  49. Tamassia, R. (1987) On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing 16(3), 421–444

    Article  MathSciNet  MATH  Google Scholar 

  50. Tamassia, R., Di Battista, G., Batini, C. (1988) Automatic Graph Drawing and readability of diagrams. IEEE Transactions on Systems, Man, and Cybernetics 18, 61–79

    Article  Google Scholar 

  51. Tutte, W. T. (1963) How to draw a graph. In: Proceedings of the London Mathematical Society, Third Series 13, 743–768

    Article  MathSciNet  MATH  Google Scholar 

  52. Walker II, J. Q. (1990) A node-positioning algorithm for general trees. Software — Practice and Experience 20, 685–705

    Article  Google Scholar 

  53. Ziegler, T. (2001) Crossing minimization in automatic Graph Drawing. Doctoral Thesis, Technische Fakultät der Universität des Saarlandes

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Cologne, Pohligstraße 1, D-50969, Köln, Germany

    Michael Jünger

  2. Konrad-Zuse-Zentrum für Informationstechnik Berlin, Takustraße 7, D-14195, Berlin, Germany

    Gunnar W. Klau

  3. Institute of Computer Graphics and Algorithms, Vienna University of Technology, Favoritenstraße 9-11, A-1040, Wien, Austria

    Petra Mutzel & René Weiskircher

Authors
  1. Michael Jünger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gunnar W. Klau
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Petra Mutzel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. René Weiskircher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität zu Köln, Pohligstraße 1, 50969, Köln, Germany

    Michael Jünger

  2. Institut für Computergraphik und Algorithmen, Technische Universität Wien, Favoritenstraße 9-11 E186, 1040, Wien, Austria

    Petra Mutzel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Jünger, M., Klau, G.W., Mutzel, P., Weiskircher, R. (2004). AGD — A Library of Algorithms for Graph Drawing. In: Jünger, M., Mutzel, P. (eds) Graph Drawing Software. Mathematics and Visualization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18638-7_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-18638-7_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-62214-4

  • Online ISBN: 978-3-642-18638-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation