AGD: a library of algorithms for graph drawing.

DOI10.1007/3-540-45848-4_52MaRDI QIDQ3043780zbMATH OpenFDO

Authors Carsten Gutwenger, Michael Jünger, Gunnar W. Klau, Sebastian Leipert, Petra Mutzel, René Weiskircher

Publication date 6 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2265/22650473.htm

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Graph drawing algorithm engineering with AGD
• LEDA. A platform for combinatorial and geometric computing. 2-part set
• JGraph -- a Java based system for drawing graphs and running graph algorithms
• scientific article; zbMATH DE number 1368469
• Algorithms for drawing graphs: An annotated bibliography

Cited in

(5)

• AGD
• Clustered planarity = flat clustered planarity
• Design and implementation of efficient data types for static graphs
• Graph drawing algorithm engineering with AGD
• LEDA. A platform for combinatorial and geometric computing. 2-part set

Describes a project that uses

Uses Software

• LEDA
• ABACUS

This page was built for publication: AGD: a library of algorithms for graph drawing.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3043780)