AGD: A Library of Algorithms for Graph Drawing

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2265)


The AGD library provides algorithms, data structures, and tools to create geometric representations of graphs and aims at bridging the gap between theory and practice in the area of graph drawing. It consists of C++ classes and is built on top of the library of efficient data types and algorithms LEDA; an optional add-on to AGD requires ABACUS, a frameworkfor the implementation of branch-and-cut algorithms, and contains implementations of exact algorithms for many NP-hard optimization problems in algorithmic graph drawing.


Exact Algorithm Programming Paradigm Graph Editor Graph Drawing Generic Layout 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  1. 1.Stiftung casesarBonnGermany
  2. 2.Universität zu KölnGermany
  3. 3.Technische Universität WienAustria

Personalised recommendations