Drawing algorithms for Series-Parallel digraphs in two and three dimensions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1547, Issue , 1999, Pages 198-209

  Hong, Seok Hee ^a   Eades, Peter ^b   Quigley, Aaron ^b   Lee, Sang Ho ^a  

^a Ewha Womans University   (South Korea)

^b UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957870514     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_15     Document Type: Conference Paper

References (15)

1. A. Aho, J. Hopcroft and J. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. P. Bertolazzi, R.F. Cohen, G. D. Battista, R. Tamassia and I. G. Tollis, How to Draw a Series-Parallel Digraph, International Journal of Computational Geometry and Applications, 4 (4), pp 385-402, 1994.
3. R.F. Cohen, G. D. 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.
4. P. Eades and X. Lin, Spring Algorithms and Symmetry, Computing and Combinatorics, Springer Lecture Notes in Computer Science 1276, (Ed. Jiang and Lee), 202-211.
5. P. Eades, T. Lin and X. Lin, Minimum Size h-v Drawings, Advanced Visual Interfaces (Proceedings of AVI 92, Rome, July 1992), World Scientific Series in Computer Science 36, pp. 386-394.
6. X. Lin, Analysis of Algorithms for Drawing Graphs, PhD thesis, University of Queensland 1992.
7. A. Lubiw, Some NP-Complete Problems similar to Graph Isomorphism, SIAM Journal on Computing 10(1):11-21, 1981.
8. J. Manning and M. J. Atallah, Fast Detection and Display of Symmetry in Trees, Congressus Numerantium 64, pp. 159-169, 1988.
9. J. Manning and M. J. Atallah, Fast Detection and Display of Symmetry in Outer- planar Graphs, Discrete Applied Mathematics 39, pp. 13-35, 1992.
10. J. Manning, Geometric Symmetry in Graphs, PhD Thesis, Purdue University 1990.
11. R.A. Mathon, A Note on Graph Isomorphism Counting Problem, Information Processing Letters 8, 1979, pp. 131-132.
12. R. Tamassia and I. G. Tollis, A unified approach to visibility representations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 321-341.
13. J. Valdes, R. Tarjan and E. Lawler, The Recognition of Series-Parallel Digraphs, SIAM Journal on Computing 11(2), pp. 298-313, 1982.
14. J. Valdes, Parsing Flowchart and Series-Parallel Graphs, Technical Report STAN- CS-78-682, Computer Science Department, Stanford University, 1978.
15. H. Wielandt, Finite permutation groups, Academic Press, 1964.