Cluster busting in anchored graph drawing

Graphs are used to model many objects in computer science, such as VLSI circuits, networks, and large software designs. Using graphs to represent complex structures and relations often simplifies the presentation of these structures. It is not surprising that there has been a recent demand for algorithms that display a graph on a two-dimensional surface so that the resulting drawing is easy to read and understand.In this paper, we present a brief survey of the field of automatic graph layout. We identify the problem of visualizing distributed systems as an area in which graph layout algorithms are often required. We discuss layout problems specific to the application of drawing graphs of distributed networks and systems, and present four algorithms for solving these problems.

[1]  Leon Steinberg,et al.  The Backboard Wiring Problem: A Placement Algorithm , 1961 .

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

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

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

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

[6]  Giuseppe Di Battista,et al.  A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees , 1992, Comput. Geom..

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

[8]  Ioannis G. Tollis,et al.  Lower Bounds for Planar Orthogonal Drawings of Graphs , 1991, Inf. Process. Lett..

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

[10]  W. E. Donath.  Statistical Properties of the Placement of a Graph , 1968 .

[11]  Sven Moen,et al.  Drawing dynamic trees , 1990, IEEE Software.

[12]  N. Quinn,et al.  A forced directed component placement procedure for printed circuit boards , 1979 .

[13]  Charles Wetherell,et al.  Tidy Drawings of Trees , 1979, IEEE Transactions on Software Engineering.

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

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

[16]  D. L. Caskey,et al.  ACCEL: Automated circuit card etching layout , 1967 .

[17]  Frances Paulisch,et al.  Using constraints to achieve stability in automatic graph layout algorithms , 1990, CHI '90.

[18]  Lawrence A. Rowe,et al.  A divide-and-conquer algorithm for the automatic layout of large directed graphs , 1991, IEEE Trans. Syst. Man Cybern..

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

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

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

[22]  Edward M. Reingold,et al.  Graph drawing by force‐directed placement , 1991, Softw. Pract. Exp..

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

[24]  Edward M. Reingold,et al.  Tidier Drawings of Trees , 1981, IEEE Transactions on Software Engineering.

[25]  Ioannis G. Tollis,et al.  A framework for dynamic graph drawing , 1992, SCG '92.

[26]  Stavros S. Cosmadakis,et al.  The Complexity of Minimizing Wire Lengths in VLSI Layouts , 1987, Inf. Process. Lett..

[27]  Mandyam M. Srinivasan,et al.  NetMod: A Design Tool for Large-Scale Heterogeneous Campus Networks , 1991, IEEE J. Sel. Areas Commun..

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

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

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

[31]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

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

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

[34]  Richard J. Lipton,et al.  A method for drawing graphs , 1985, SCG '85.

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

[36]  Walter F. Tichy,et al.  Edge: An extendible graph editor , 1990, Softw. Pract. Exp..

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

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

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

[40]  Bernd Becker,et al.  Layouts with Wires of Balanced Length , 1987, Inf. Comput..

[41]  Georges Voronoi.  Nouvelles applications des paramètres continus à la théorie des formes quadratiques. Deuxième mémoire. Recherches sur les parallélloèdres primitifs. , 1908 .

[42]  John Q. Walker,et al.  A node‐positioning algorithm for general trees , 1990, Softw. Pract. Exp..

[43]  Manojit Sarkar,et al.  Graphical fisheye views of graphs , 1992, CHI.

[44]  Franz-Josef Brandenburg,et al.  On the Complexity of Optimal Drawings of Graphs , 1989, WG.