AGD: A Library of Algorithms for Graph Drawing

Gutwenger, Carsten and Jünger, Michael and Klau, Gunnar W. and Leipert, Sebastian and Mutzel, Petra and Weiskircher, René (2002) AGD: A Library of Algorithms for Graph Drawing. In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 473-474(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_52).

Full text not available from this repository.

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 framework for the implementation of branch-and-cut algorithms, and contains implementations of exact algorithms for many NP-hard optimization problems in algorithmic graph drawing. The fully documented library is freely available for non-commercial use at http://www.ads.tuwien.ac.at/AGD. The site also contains an online manual, link to AGD. The site also contains an online manual, links to AGD related papers, and contact information.

Item Type:	Conference Paper
Additional Information:	10.1007/3-540-45848-4_52
Classifications:	S Software and Systems > S.001 General
URI:	http://gdea.informatik.uni-koeln.de/id/eprint/500

Actions (login required)

View Item