An algorithm for finding three dimensional symmetry in series parallel digraphs

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

Volumn 1969, Issue , 2000, Pages 266-277

  Hong, Seok Hee ^a   Eades, Peter ^a  

^a UNIVERSITY OF SYDNEY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DRAWING (GRAPHICS);

AESTHETIC CRITERIA; GRAPH DRAWING; LINEAR-TIME ALGORITHMS; SERIES-PARALLEL; THREE DIMENSIONS; THREE-DIMENSIONAL SYMMETRY; TWO-DIMENSION;

DIRECTED GRAPHS;

EID: 84949774130     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_23     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. H. Carr and W. Kocay, An Algorithm for Drawing a Graph Symmetrically, Bulletin of the ICA, Vol. 27, pp. 19-25, 1999.
4. 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.
5. P. Eades and X. Lin, Spring Algorithms and Symmetry, Computing and Combinatorics, Springer Lecture Notes in Computer Science 1276, (Ed. Jiang and Lee), pp. 202-211.
6. H. Fraysseix, An Heuristic for Graph Symmetry Detection, Graph Drawing'99, Lecture Notes in Computer Science 1731, (Ed. J. Kratochvil), pp. 276-285, Springer Verlag, 1999.
7. S. Hong, P. Eades, A. Quigley and S. Lee, Drawing Algorithms for Series Parallel Digraphs in Two and Three Dimensions, In S. Whitesides, editor, Graph Drawing (Proc. GD'98), vol. 1547 of Lecture Notes in Computer Science, pp. 198-209, Springer Verlag, 1998.
8. S. Hong, P. Eades and S. Lee, An Algorithm for Finding Geometric Automorphisms in Planar Graphs, Algorithms and Computation, (Proc. of ISAAC98), Lecture Notes in Computer Science 1533, (Ed. Chwa and Ibarra), pp. 277-286, Springer Verlag, 1998.
9. S. Hong and P. Eades, An Algorithms for Finding Three Dimensional Symmetry in Trees, to appear Graph Drawing (Proc. GD'2000), Lecture Notes in Computer Science, Springer Verlag, 2000.
10. X. Lin, Analysis of Algorithms for Drawing Graphs, Ph.D. Thesis, University of Queensland, 1992.
11. J. Manning and M. J. Atallah, Fast Detection and Display of Symmetry in Trees, Congressus Numerantium, 64, pp. 159-169, 1988.
12. J. Manning and M. J. Atallah, Fast Detection and Display of Symmetry in Outerplanar Graphs, Discrete Applied Mathematics, 39, pp. 13-35, 1992.
13. J. Manning, Geometric Symmetry in Graphs, Ph.D. Thesis, Purdue Univ., 1990.
14. G. E. Martin, Transformation Geometry, an Introduction to Symmetry, Springer, New York, 1982.
15. J. Valdes, R. Tarjan and E. Lawler, The Recognition of Series Parallel Digraphs, SIAM Journal on Computing 11(2), pp. 298-313, 1982.