An algorithm for drawing a hierarchical graph

International Journal of Computational Geometry and Applications

Volumn 6, Issue 2, 1996, Pages 145-155

  Eades, Peter ^a   Lin, Xuemin ^b   Tamassia, Roberto ^c  

^a UNIVERSITY OF NEWCASTLE   (Australia)

^b UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

^c Brown Univerity   (United States)

Author keywords

Edge crossings; Graph drawing; Hierarchical graph; Planarity; Symmetry

Indexed keywords

EID: 0030543591     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195996000101     Document Type: Article

References (18)

1. B. Becker and G. Hotz, "On the optimal layout of planar graphs with fixed boundary", SIAM J. Computing 16 (1987) 946-972.
2. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, (Macmillan, 1976).
3. J. Czyzowicz, A. Pelc and I. Rival, "Drawing orders with few slopes", Technical Report TR-87-12, Department of Computer Science, University of Ottawa, 1987.
4. G. Di Battista, P. Eades, R. Tamassia and I. Tollis, "Algorithms for Drawing Graphs: An Annotated Bibliography", Comp. Geom. Theory Appl., 4 (1994) 235 - 282.
5. G. Di Battista and E. Nardelli, "Hierarchies and planarity theory", IEEE Tran. Syst., Man, Cybern. 18 (1988) 1035-1046.
6. P. Eades and X. Lin, "How to Draw a Directed Graph," Proc. IEEE Workshop on Visual Languages (VL'89),pp. 13-17, 1989.
7. P. Eades and N. C. Wormald, "Edge crossings in drawings of bipartite graphs", Technical Report 108, Department of Computer Science, University of Queensland, 1989.
8. P. Eades and N. C. Wormald, "Fixed edge length graph drawing is NP-hard", Discrete Applied Mathematics 28 (1990) 111-134.
9. E. R. Gansner, S. C. North and K. P. Vo, "DAG - a program that draws directed graphs", Software Practice and Experience, 18 (1988) 1047-1062.
10. M. R. Garey and D. S. Johnson, "Crossing number is NP-complete", SIAM J. of Algebraic and Discrete Methods, 4 (1983) 312-316.
11. X. Lin, "Analysis of algorithms for drawing graphs", Ph. D Thesis, Department of Computer Science, University of Queensland, 1992.
12. E. Mäkinen, "Experiments in drawing 2-Level hierarchical graphs", Technical Report A-1988-1, Department of Computer Science, University of Tampere, 1988.
13. F. J. Newbery, "Edge concentration: a method for clustering directed graphs", in Proc. 2nd Int. Workshop on Software Configuration Management, 1989, pp. 76-85.
14. L. A. Rowe, M. Davis, E. Messinger, C. Meyer, C. Spirakis and A. Tuan, "A browser for directed graphs", Software Practice and Experience 17 (1987) 61-76.
15. K. Sugiyama, S. Tagawa and M. Toda, "Methods for visual understanding of hierarchical system structures", IEEE Tran. Syst., Man, Cybern. SMC-11 (1981) 109-125.
16. R. Tamassia, "On embedding a graph in the grid with the minimum number of bends", SIAM J. Computing 16 (1987) 421-444.
17. W. T. Tutte, "Convex representations of graphs", Proc. London Math. Soc. 10 (1960) 304-320.
18. W. T. Tutte, "How to draw a graph", Proc. London Math. Soc. 13 (1963) 743-768.