Graph Drawing Algorithm Engineering with AGD

Authors:
Carsten Gutwenger;Michael Jünger;Gunnar W. Klau;Sebastian Leipert;Petra Mutzel
Affiliations:
-;-;-;-;-
Venue:
Revised Lectures on Software Visualization, International Seminar
Year:
2001

Citing 21
Cited 5

Computer aided layout of entity relationship diagrams

Journal of Systems and Software - Special double issue on the entity-relationship approach to databases and related software
A Layout algorithm for data flow diagrams

IEEE Transactions on Software Engineering
Combinatorial algorithms for integrated circuit layout

Combinatorial algorithms for integrated circuit layout
Graph drawing by force-directed placement

Software—Practice & Experience
Area requirement and symmetry display of planar upward drawings

Discrete & Computational Geometry
On-Line Planarity Testing

SIAM Journal on Computing
A new approximation algorithm for the planar augmentation problem

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
LEDA: a platform for combinatorial and geometric computing

LEDA: a platform for combinatorial and geometric computing
Turn-regularity and optimal area drawings of orthogonal representations

Computational Geometry: Theory and Applications
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software—Practice & Experience - Special issue on discrete algorithm engineering
Inserting an edge into a planar graph

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A Technique for Drawing Directed Graphs

IEEE Transactions on Software Engineering
Optimal Compaction of Orthogonal Grid Drawings

Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Drawing High Degree Graphs with Low Bend Numbers

GD '95 Proceedings of the Symposium on Graph Drawing
Planar Polyline Drawings with Good Angular Resolution

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
Algorithmic Patterns for Orthogonal Graph Drawing

GD '98 Proceedings of the 6th International Symposium on Graph Drawing
A Linear Time Implementation of SPQR-Trees

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
A Fast Layout Algorithm for k-Level Graphs

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
An Experimental Comparison of Orthogonal Compaction Algorithms (Extended Abstract)

GD '00 Proceedings of the 8th International Symposium on Graph Drawing
The Polyhedral Approach to the Maximum Planar Subgraph Problem: New Chances for Related Problems

GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
A note on computing a maximal planar subgraph using PQ-trees

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Drawing database schemas

Software—Practice & Experience
Simple and Efficient Bilayer Cross Counting

GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Human-guided tabu search

Eighteenth national conference on Artificial intelligence
How to draw the minimum cuts of a planar graph

Computational Geometry: Theory and Applications
The SPQR-tree data structure in graph drawing

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the algorithm engineering aspects of AGD, a software library of algorithms for graph drawing. AGD represents algorithms as classes that provide one or more methods for calling the algorithm. There is a common base class, also called the type of an algorithm, for algorithms providing basically the same functionality. This enables us to exchange components and experiment with various algorithms and implementations of the same type. We give examples for algorithm engineering with AGD for drawing general non-hierarchical graphs and hierarchical graphs.