C. Gutwenger, M. Jünger, G.W. Klau, S. Leipert, P. Mutzel, R. Weiskircher
Published in:
P. Mutzel, M. Jünger, S. Leipert, Editors, 9th International Symposium, Graph Drawing 2001 in Vienna, volume 2265, Lecture Notes in Computer Science, Springer Verlag (2002) 473 – 474.
Abstract
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.
