论文信息 - Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions

Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions

In this paper we have introduced two algorithms for drawing series parallel digraphs. One constructs two dimensional drawings which display symmetries, the other constructs three dimensional drawings with a footprint of minimum size.

[1] Jacobo Valdes. Parsing Flowcharts and Series-Parallel Graphs , 1978 .

[2] Anna Lubiw,et al. Some NP-Complete Problems Similar to Graph Isomorphism , 1981, SIAM J. Comput..

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

[4] Tao Lin,et al. Minimum Size h-v Drawings , 1992, Advanced Visual Interfaces.

[5] H. Wielandt,et al. Finite Permutation Groups , 1964 .

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

[7] Ioannis G. Tollis,et al. Dynamic Graph Drawings: Trees, Series-Parallel Digraphs, and Planar ST-Digraphs , 1995, SIAM J. Comput..

[8] Ioannis G. Tollis,et al. How to Draw a Series-Parallel Digraph , 1994, Int. J. Comput. Geom. Appl..

[9] Joseph Manning. Geometric symmetry in graphs , 1992 .

[10] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[11] Xuemin Lin,et al. Spring algorithms and symmetry , 2000, Theor. Comput. Sci..

[12] Eugene L. Lawler,et al. The recognition of Series Parallel digraphs , 1979, SIAM J. Comput..

[13] Rudolf Mathon,et al. A Note on the Graph Isomorphism counting Problem , 1979, Inf. Process. Lett..

[14] Mikhail J. Atallah,et al. Fast Detection and Display of Symmetry in Outerplanar Graphs , 1992, Discret. Appl. Math..