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

Hong, Seok-Hee and Eades, Peter and Quigley, Aaron and Lee, Sang-Ho (1998) Drawing Algorithms for Series-Parallel Digraphs in Two and Three Dimensions. In: Graph Drawing 6th International Symposium, GD’ 98, August 13-15, 1998, Montréal, Canada , pp. 198-209 (Official URL: http://dx.doi.org/10.1007/3-540-37623-2_15).

Full text not available from this repository.

Abstract

No Abstract

Item Type:Conference Paper
Additional Information:10.1007/3-540-37623-2_15
Classifications:G Algorithms and Complexity > G.910 Symmetries
G Algorithms and Complexity > G.999 Others
P Styles > P.060 3D
ID Code:288

Repository Staff Only: item control page

References

A. Aho, J. Hopcroft, and j. Ullman. The design and analysis of computer algorithms, Addison-Wesley, 1974.

P. Bertolazzi, R.F. Cohen, G. Di Battista, R. Tamassia, and I.G. Tollis. How to draw a series-parallel digraph. Internat. J. Comput. Geom. Appl., 4:385-402, 1994.

R.F. Cohen, G. Di Battista, R. Tamassia, and I.G. Tollis. Dynamic graph drawing: Trees, series-parallel digraphs, and planar st-digraphs. SIAM journal on Computing, 24(5), pp. 970-1001, 1995.

P. Eades and X. Lin. Spring algorithms and symmetry. Computing and Combinatorics, LNCS 1276:202-211.

P. Eades, T.Lin and X. Lin. Minimum size h-v drawings. Advanced visual interfaces (Proc. of AVI 92, Rome, July 1992), World Scientific Series in Computer Science36, pp. 386-394.

Xuemin Lin. Analysis of algorithms for drawing graphs. PhD thesis, Department of Computer Science, University of Queensland, Australia, 1992.

A. Lubiw. Some NP-complete problems similar to Graph Isomorphism, SIAM Journal on Computing 10(1):11-21, 1981.

J. Manning and M.J. Atallah. Fast detection and display of symmetry in trees. Congressus Numerantium 64, pp. 159-169, 1988.

J. Manning and M.J. Atallah. Fast detection and display of symmetry in outerplanar graphs. Discrete Applied Mathematics 39, pp. 13-35, 1992.

J. Manning. Geometric Symmetry in graphs. PhD thesis, Purdue University, 1990.

R.A. Mathon. Anote on graph isomorphism counting problem. Information Processing Letters 8, 1979, pp. 131-132.

R. Tamassia and I.G. Tollis. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom., 1(4):321-341, 1986.

J. Valdes, R. Tarjan, and E. Lawler. The recognition of series-parallel digraphs. SIAM J. Comput. 11(2):298-313, 1982.

J. Valdes. Parsing Flowchart and Series-Parallel Graphs. Technical Report STAN-CS-78-682, Computer Science Department, Stanford University, 1978.

H. Wielandt. Finite permutation groups. Academic Press, 1964.