Drawing series parallel digraphs symmetrically

Computational Geometry: Theory and Applications

Volumn 17, Issue 3-4, 2000, Pages 165-188

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

^a UNIVERSITY OF SYDNEY   (Australia)

^b Ewha Womans University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347899516     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(00)00020-1     Document Type: Article

References (19)

1. Aho A., Hopcroft J., Ullman J. The Design and Analysis of Computer Algorithms. 1974;Addison-Wesley, Reading, MA.
2. Babai L. Automorphism groups, isomorphism, and reconstruction. Graham, Groetschel, Lovasz. Handbook of Combinatorics. 2:1995;Elsevier, Amsterdam. Chapter 27.
3. Bachl S. Isomorphic subgraphs, graph drawing. Kratochvil J. Lecture Notes in Computer Science. 1731:1999;286-296 Springer, Berlin.
4. Bertolazzi P., Cohen R.F., di Battista G., Tamassia R., Tollis I.G. How to draw a series-parallel digraph. Internat. J. Comput. Geom. Appl. 4:(4):1994;385-402.
5. K.-W. Chin, H.-C. Yen, Algorithms and complexity analysis of the symmetry number for graphs, manuscript, 1998.
6. Cohen R.F., di Battista G., Tamassia R., Tollis I.G. Dynamic graph drawing: trees, series-parallel digraphs, and planar st-digraphs. SIAM J. Comput. 24:(5):1995;970-1001.
7. Di Battista G., Eades P., Tamassia R., Tollis I.G. Graph Drawing: Algorithms for the Visualization of Graphs. 1998;Prentice-Hall, Englewood Cliffs, NJ.
8. Eades P., Lin X. Spring algorithms and symmetry. Theoret. Comput. Sci. 240:(2):2000;379-405.
9. Hong S.-H., Eades P., Lee S.-H. Finding planar geometric automorphisms of planar graphs. Chwa, Ibarra. Algorithms and Computation. Lecture Notes in Computer Science. 1533:1998;Springer, Berlin. pp. 277-286.
10. Lin X. Analysis of Algorithms for Drawing Graphs. Ph.D. Thesis. 1992;University of Queensland.
11. Lubiw A. Some NP-complete problems similar to graph isomorphism. SIAM J. Comput. 10:(1):1981;11-21.
12. Manning J., Atallah M.J. Fast detection and display of symmetry in trees. Congr. Numer. 64:1988;159-169.
13. Manning J., Atallah M.J. Fast detection and display of symmetry in outer-planar graphs. Discrete Appl. Math. 39:1992;13-35.
14. Manning J. Geometric Symmetry in Graphs. Ph.D. Thesis. 1990;Purdue University.
15. Mathon R.A. A note on graph isomorphism counting problem. Inform. Process. Lett. 8:1979;131-132.
16. Tamassia R., Tollis I.G. A unified approach to visibility representations of planar graphs. Discrete Comput. Geom. 1:1986;321-341.
17. Valdes J., Tarjan R., Lawler E. The recognition of series-parallel digraphs. SIAM J. Comput. 11:(2):1982;298-313.
18. Valdes J. Parsing flowchart and series-parallel graphs, Technical Report STAN-CS-78-682. 1978;Computer Science Department, Stanford University.
19. Wielandt H. Finite Permutation Groups. 1964;Academic Press, New York.