How to draw a directed graph

Several recent tools for visualizing software and information engineering problems have used directed graphs as a basic model. Thus considerable interest has arisen in algorithms for drawing directed graphs so that they are easy to understand and remember. The paper defines three aesthetic criteria for drawings of directed graphs, and discusses a general method for obtaining drawings according to these criteria. Several recent algorithms to draw directed graphs are instances of this general method. The aesthetic criteria can be viewed as goals of optimization problems. Each step of the general method aims to achieve one of the criteria by solving these optimization problems. The authors discuss the current state of knowledge of each of these problems.<<ETX>>

[1]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Brendan D. McKay,et al.  On an edge crossing problem , 1986 .

[4]  Erkki Mäkinen,et al.  Experiments on drawing 2-level hierarchical graphs , 1990, Int. J. Comput. Math..

[5]  Enrico Nardelli,et al.  An Algorithm for Testing Planarity of Hierarchical Graphs , 1987, WG.

[6]  Carlo Batini,et al.  Automatic graph drawing and readability of diagrams , 1988, IEEE Trans. Syst. Man Cybern..

[7]  Alberto Sangiovanni-Vincentelli,et al.  ThunderBird: a complete standard cell layout package , 1988 .

[8]  Kozo Sugiyama,et al.  A cognitive approach for graph drawing , 1987 .

[9]  John N. Warfield,et al.  Crossing Theory and Hierarchy Mapping , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[10]  K. P. Vo,et al.  DAG—a program that draws directed graphs , 1988, Softw. Pract. Exp..

[11]  Lawrence A. Rowe,et al.  A browser for directed graphs , 1987, Softw. Pract. Exp..

[12]  David S. Johnson,et al.  Crossing Number is NP-Complete , 1983 .

[13]  R. Edwards,et al.  Algorithms +data structures + Programs, N. Wirth, prentice‐hall inc., Engelwood Cliffs, N.J., 1976. no. of pages: 366. price: £9‐70 , 1977 .

[14]  Howard Trickey,et al.  Drag: a graph drawing system , 1988 .

[15]  Niklaus Wirth,et al.  Algorithms + Data Structures = Programs , 1976 .

[16]  W. T. Tutte.  How to Draw a Graph , 1963 .