Algorithms for Drawing Graphs: an Annotated Bibliography

Several data presentation problems involve drawing graphs so that they are easy to read and understand. Examples include circuit schematics and diagrams for information systems analysis and design. In this paper we present a bibliographic survey on algorithms whose goal is to produce aesthetically pleasing drawings of graphs. Research on this topic is spread over the broad spectrum of computer science. This bibliography constitutes a first attempt to encompass both theoretical and application-oriented papers from disparate areas.

[1]  G. Battista,et al.  Hierarchies and planarity theory , 1988, IEEE Trans. Syst. Man Cybern..

[2]  Frank Harary,et al.  Graph Theory , 2016 .

[3]  David Kelly.  Fundamentals of planar ordered sets , 1987, Discret. Math..

[4]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[5]  Roberto Tamassia,et al.  A Graphical Tool for Conceptual Design of Data Base Applications , 1983, 20th Design Automation Conference Proceedings.

[6]  V. Vijayan,et al.  Geometry of planar graphs with angles , 1986, SCG '86.

[7]  Xuemin Lin,et al.  How to draw a directed graph , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

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

[9]  G. Kar,et al.  Heuristic layout algorithms for network management presentation services , 1988, IEEE Network.

[10]  Robert H. Henry,et al.  Automatic layout of large directed graphs , 1988 .

[11]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[12]  James A. Storer,et al.  On minimal-node-cost planar embeddings , 1984, Networks.

[13]  D. R. Woods.  Drawing planar graphs , 1981 .

[14]  Margaret Bernard.  On the Automated Drawing of Graphs , 1981 .

[15]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[16]  Carlo Batini,et al.  Computer aided layout of entity relationship diagrams , 1984, J. Syst. Softw..

[17]  Robert E. Tarjan,et al.  Efficient Planarity Testing , 1974, JACM.

[18]  Alexander K. Hope.  A planar graph drawing program , 1971, Softw. Pract. Exp..

[19]  Jean G. Vaucher.  Pretty‐printing of trees , 1980, Softw. Pract. Exp..

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

[21]  Roberto Tamassia,et al.  New Layout Techniques for Entity-Relationship Diagrams , 1985, International Conference on Conceptual Modeling.

[22]  鎌田 富久.  On visualization of abstract objects and relations , 1989 .

[23]  Hiroyuki Watanabe,et al.  Heuristic Graph Displayer for G-BASE , 1989, Int. J. Man Mach. Stud..

[24]  Norishige Chiba,et al.  A Linear Algorithm for Embedding Planar Graphs Using PQ-Trees , 1985, J. Comput. Syst. Sci..

[25]  Robert E. Tarjan,et al.  Rectilinear planar layouts and bipolar orientations of planar graphs , 1986, Discret. Comput. Geom..

[26]  Carsten Thomassen.  Rectilinear drawings of graphs , 1988, J. Graph Theory.

[27]  Takao Nishizeki,et al.  Planar Graphs: Theory and Algorithms , 1988 .

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

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

[30]  Carlo Batini,et al.  A layout algorithm for data flow diagrams , 1986, IEEE Transactions on Software Engineering.

[31]  Satoru Kawai,et al.  An Algorithm for Drawing General Undirected Graphs , 1989, Inf. Process. Lett..

[32]  Ioannis G. Tollis,et al.  Area requirement and symmetry display in drawing graphs , 1989, SCG '89.

[33]  Steven P. Reiss.  Interacting with the field environment , 1990, Softw. Pract. Exp..

[34]  David Harel,et al.  On visual formalisms , 1988, CACM.

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

[36]  Walter F. Tichy,et al.  Knowledge-based Editors for Directed Graphs , 1987, ESEC.

[37]  Tiko Kameda,et al.  On the Vector Representation of the Reachability in Planar Directed Graphs , 1975, Inf. Process. Lett..

[38]  Sartaj Sahni,et al.  A linear algorithm to find a rectangular dual of a planar triangulated graph , 1986, 23rd ACM/IEEE Design Automation Conference.

[39]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[40]  Carlo Batini,et al.  What is a Good Diagram? A Pragmatic Approach , 1985, ER.

[41]  Richard E. Sweet,et al.  Empirical estimates of program entropy , 1977 .

[42]  C. R. Platt,et al.  Planar lattices and planar graphs , 1976, J. Comb. Theory, Ser. B.

[43]  Vijaya Ramachandran,et al.  An optimal parallel algorithm for graph planarity , 1989, 30th Annual Symposium on Foundations of Computer Science.

[44]  W. T. Tutte.  Convex Representations of Graphs , 1960 .

[45]  András Frank.  How to make a digraph strongly connected , 1981, Comb..

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

[47]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[48]  Avi Wigderson,et al.  Rectilinear Graphs and their Embeddings , 1985, SIAM J. Comput..

[49]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

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

[51]  Tomihisa Kamada,et al.  Visualizing Abstract Objects and Relations , 1989, World Scientific Series in Computer Science.

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

[53]  Stephen K. Wismath,et al.  Characterizing bar line-of-sight graphs , 1985, SCG '85.

[54]  Ioannis G. Tollis,et al.  Centipede Graphs and Visibility on a Cylinder , 1986, WG.

[55]  Jock D. Mackinlay,et al.  Automating the design of graphical presentations of relational information , 1986, TOGS.

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

[57]  Sumio Masuda,et al.  Crossing Minimization in Linear Embeddings of Graphs , 1990, IEEE Trans. Computers.

[58]  János Pach,et al.  Small sets supporting fary embeddings of planar graphs , 1988, STOC '88.

[59]  Ioannis G. Tollis,et al.  Automatic layout of PERT diagrams with X-PERT , 1989, [Proceedings] 1989 IEEE Workshop on Visual Languages.

[60]  James B. Orlin,et al.  NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings , 1985, J. Algorithms.

[61]  M. N. Shanmukha Swamy,et al.  O(n²) Algorithms for Graph Planarization , 1988, WG.

[62]  Joseph JáJá,et al.  Parallel Algorithms in Graph Theory: Planarity Testing , 1982, SIAM J. Comput..

[63]  M.N.S. Swamy,et al.  O(n2) algorithms for graph planarization , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[64]  Marcello G. Reggiani,et al.  A proposed method for representing hierarchies , 1988, IEEE Trans. Syst. Man Cybern..

[65]  Pierre Rosenstiehl,et al.  A Depth-First-Search Characterization of Planarity , 1982 .

[66]  David G. Kirkpatrick,et al.  Weighted Visibility Graphs of Bars and Related Flow Problems (Extended Abstract) , 1989, WADS.

[67]  David S. Johnson,et al.  Hypergraph planarity and the complexity of drawing venn diagrams , 1987, J. Graph Theory.

[68]  Yahya Ould Hamidoune,et al.  Representing a planar graph by vertical lines joining different levels , 1983, Discret. Math..

[69]  Steven P. Reiss.  Integration Mechanisms in the FIELD Environment , 1988 .

[70]  I. Rival.  Graphical Data Structures for Ordered Sets , 1989 .

[71]  Fabrizio Luccio,et al.  A Visibility Problem in VLSI Layout Compaction , 1984 .

[72]  F. J. Newbery.  Edge concentration: a method for clustering directed graphs , 1989 .

[73]  David Jablonowski,et al.  GMB: A tool for manipulating and animating graph data structures , 1989, Softw. Pract. Exp..

[74]  Penny Rheingans,et al.  A Database Designer's Workbench , 1986, ER.

[75]  C. Thomassen.  Planar acyclic oriented graphs , 1989 .

[76]  Heiko Harborth,et al.  Edges without crossings in drawings of complete graphs , 1974 .

[77]  E. Reingold,et al.  Combinatorial Algorithms: Theory and Practice , 1977 .

[78]  Roberto Tamassia,et al.  On Embedding a Graph in the Grid with the Minimum Number of Bends , 1987, SIAM J. Comput..

[79]  D. Dolev,et al.  Planar Embedding of Planar Graphs , 1983 .

[80]  Erkki Mäkinen.  On circular layouts , 1988 .

[81]  Férid Aoudja,et al.  CASE: automatic generation of electrical diagrams , 1986 .

[82]  K. Wagner.  Bemerkungen zum Vierfarbenproblem. , 1936 .

[83]  Bernd Becker,et al.  On the Optimal Layout of Planar Graphs with Fixed Boundary , 1987, SIAM J. Comput..

[84]  Amit Misra,et al.  Automatic Generation of Digital System Schematic Diagrams , 1985, DAC 1985.

[85]  Narsingh Deo,et al.  Note on Hopcroft and Tarjan's Planarity Algorithm , 1976, J. ACM.

[86]  Michel Habib,et al.  CABRI, An Interactive System for Graph Manipulation , 1986, WG.

[87]  Michael Himsolt.  Graph^Ed: An Interactive Garpg Editor , 1989, STACS.

[88]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[89]  Jeffrey Scott Vitter,et al.  Optimal parallel algorithms for transitive closure and point location in planar structures , 1989, SPAA '89.

[90]  Chak-Kuen Wong,et al.  A note on visibility graphs , 1987, Discret. Math..

[91]  Angelo Gregori,et al.  Unit-Length Embedding of Binary Trees on a Square Grid , 1989, Inf. Process. Lett..

[92]  Gary L. Miller,et al.  Parallel tree contraction and its application , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[93]  Peter Eades,et al.  A Heuristic for Graph Drawing , 1984 .

[94]  F. J. Newbery.  An interface description language for graph editors , 1988, [Proceedings] 1988 IEEE Workshop on Visual Languages.

[95]  Marie-Jose Carpano,et al.  Automatic Display of Hierarchized Graphs for Computer-Aided Decision Analysis , 1980, IEEE Transactions on Systems, Man, and Cybernetics.

[96]  M.N.S. Swamy,et al.  On maximal planarization of nonplanar graphs , 1986 .

[97]  Ioannis G. Tollis,et al.  Planar grid embedding in linear time , 1989 .

[98]  M. Yannakakis.  The Complexity of the Partial Order Dimension Problem , 1982 .

[99]  Robert E. Tarjan,et al.  Computing an st -Numbering , 1976, Theor. Comput. Sci..

[100]  C. Esposito,et al.  Graph graphics: Theory and practice , 1988 .

[101]  Roberto Tamassia,et al.  Incremental planarity testing , 1989, 30th Annual Symposium on Foundations of Computer Science.

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

[103]  Mikhail J. Atallah,et al.  Fast Detection and Display of Symmetry in Trees , 1985 .

[104]  Eades Peter.  Complexity Issues in Drawing Directed Graphs , 1989 .

[105]  John E. Savage.  Heuristics for Level Graph Embeddings , 1983, WG.

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

[107]  Ellis Horowitz,et al.  Fundamentals of Data Structures , 1984 .

[108]  M.N.S. Swamy,et al.  Planar embedding: linear-time algorithms for vertex placement and edge orderings , 1988 .

[109]  Joseph Manning,et al.  Computational Complexity of Geometric Symmetry Detection in Graphs , 1989, Great Lakes Computer Science Conference.

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

[111]  R. Guy.  Crossing numbers of graphs , 1972 .