论文信息 - Area-Efficient Static and Incremental Graph Drawings

Area-Efficient Static and Incremental Graph Drawings

In this paper, we present algorithms to produce orthogonal drawings of arbitrary graphs. As opposed to most known algorithms, we do not restrict ourselves to graphs with maximum degree 4. The best previous result gave an \((m - 1) \times \left( {\tfrac{m}{2} + 1} \right)\)-grid for graphs with n nodes and m edges.

Michael Kaufmann | Therese C. Biedl | T. Biedl | M. Kaufmann

[1] Paul F. Dietz,et al. Two algorithms for maintaining order in a list , 1987, STOC.

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

[3] Goos Kant,et al. 2-Visibility Drawings of Planar Graphs , 1996, GD.

[4] G. Kant. Algorithms for drawing planar graphs , 1993 .

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

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

[7] Ioannis G. Tollis,et al. The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing , 1997, Graph Drawing.

[8] Ioannis G. Tollis,et al. Issues in Interactive Orthogonal Graph Drawing , 1995, GD.

[9] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .

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

[11] Thomas C. Shermer,et al. On representations of some thickness-two graphs , 1995, Comput. Geom..

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

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

[14] Michael Kaufmann,et al. Drawing High Degree Graphs with Low Bend Numbers , 1995, GD.