# Algorithms for Drawing Graphs: an Annotated Bibliography

@article{Battista1994AlgorithmsFD, title={Algorithms for Drawing Graphs: an Annotated Bibliography}, author={Giuseppe Di Battista and Peter Eades and Roberto Tamassia and Ioannis G. Tollis}, journal={Comput. Geom.}, year={1994}, volume={4}, pages={235-282} }

## Figures from this paper

## 1,028 Citations

Constraints in Graph Drawing Algorithms

- Computer ScienceConstraints
- 2004

Algorithmic techniques for graph drawing that support the expression and satisfaction of user-defined constraints are surveyed.

Cluster busting in anchored graph drawing

- Computer ScienceCASCON
- 1992

The problem of visualizing distributed systems as an area in which graph layout algorithms are often required is identified and four algorithms for solving these problems are presented.

Encoding Presentation Emphasis Algorithms for Graphs

- Computer ScienceGraph Drawing
- 1994

A high-level language is outlined that is used to select subsets of graph elements; compute a real-valued priority for each element; and encode presentation strategies that automatically emphasize elements based on subset membership and priority.

Advances in Graph Drawing

- Computer ScienceCIAC
- 1994

This paper surveys recent results of the authors on graph drawing and overviews various research trends in the area.

Graph drawing

- Computer ScienceHandbook of Discrete and Computational Geometry, 2nd Ed.
- 2004

A broad overview of graph drawing algorithms from a computational geometry perspective is overviewed.

Drawing Decorated Graphs

- Computer Science, Mathematics
- 2007

This paper discusses some well-known graph drawing algorithms and pinpoint problems arising from their generalization to decorated graphs and introduces a 3G approach to draw multi-featured diagrams.

FADE A Layout Facility for Graph based Diagrams

- Computer Science
- 1993

A framework for constrained layout problems encompassing geometrical and graph based algorithms especially dedicated to the generation of diagrams is introduced and FADE is a user parametrizable frame work for thegeneration of EXPRESS G diagrams.

A programming project: trimming the spring algorithm for drawing hypergraphs

- Computer ScienceSGCS
- 1995

A practical method for drawing hypergraphs is introduced, based on the spring algorithm, a well-known method for Drawing normal graphs.

## References

SHOWING 1-10 OF 109 REFERENCES

Automatic graph drawing and readability of diagrams

- Computer ScienceIEEE Trans. Syst. Man Cybern.
- 1988

The algorithm presented draws graphs on a grid and is suitable for both undirected graphs and mixed graphs that contain as subgraphs hierarchic structures.

On the Automated Drawing of Graphs

- Art, Mathematics
- 1981

This paper considers the procedure for the automatic drawing of trees, and graphs displaying symmetry properties, based on a computer system for the adrawing of graphs.

Automatic layout of large directed graphs

- Business
- 1988

This dissertation studies algorithms that automatically produce aesthetically pleasing drawings of relational information using vertex and edge graphs, useful for building user-interfaces for tools that create and manipulate relational information, such as PERT chart editors.

How to draw a directed graph

- Computer Science[Proceedings] 1989 IEEE Workshop on Visual Languages
- 1989

The paper defines three aesthetic criteria for drawings of directed graphs, and discusses a general method for obtaining drawings according to these criteria.

Knowledge-based Editors for Directed Graphs

- Computer ScienceESEC
- 1987

Research in knowledge-based editors for the direct, visual manipulation of directed graphs produces an aesthetically pleasing layout of the graph automatically, freeing the user from cut-and-paste work after changes.

DAG—a program that draws directed graphs

- Computer ScienceSoftw. Pract. Exp.
- 1988

DAG is a program that draws directed graphs by reading a list of noeds and edges, computing a layout and then writing a PIC or PostScript description of a picture, which works best on directed acyclic graphs.

A layout algorithm for data flow diagrams

- Computer ScienceIEEE Transactions on Software Engineering
- 1986

A layout algorithm is presented that allows the automatic drawing of data flow diagrams, a diagrammatic representation widely used in the functional analysis of information systems. A grid standard…

A browser for directed graphs

- Computer ScienceSoftw. Pract. Exp.
- 1987

A general‐purpose browser for directed graphs is described. The browser provides operations to examine and edit graphs and to generate a layout for a graph automatically that minimizes edge…