Straight-line drawing algorithms for hierarchical graphs and clustered graphs

Algorithmica (New York)

Volumn 44, Issue 1, 2006, Pages 1-32

  Eades, Peter ^a,b   Feng, Qingwen ^a   Lin, Xuemin ^b,c   Nagamochi, Hiroshi ^d  

^a UNIVERSITY OF SYDNEY   (Australia)

^b CSIRO   (Australia)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

^d KYOTO UNIVERSITY   (Japan)

Author keywords

Automatic graph drawing; Clustered graph; Computational geometry; Hierarchical graph; Straight line drawing

Indexed keywords

AUTOMATIC GRAPH DRAWING; CLUSTERED GRAPHS; STRAIGHT-LINE DRAWING;

ALGORITHMS; COMPUTATIONAL GEOMETRY; DRAWING (GRAPHICS);

GRAPH THEORY;

EID: 29544433882     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-004-1144-8     Document Type: Article

References (55)

1. G. Di Battista, W. Didimo, and A. Marcandalli. Planarization of clustered graphs. In Graph Drawing 2001, pages 60-74. Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
2. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs, NJ, 1998.
3. G. Di Battista, G. Liotta, M. Strani, and F. Vargiu. Diagram server. In Advanced Visual Interfaces (Proceedings of AVI 92), pages 415-417. Volume 36 of World Scientific Series in Computer Science. World Scientific, River Edge, NJ, 1992.
4. G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61:175-198, 1988.
5. C. Berge. Graphs and Hypergraphs. North-Holland, Amsterdam, 1973.
6. J.A. Bondy and U.S.R. Murty. Graph Theory with Applications. North-Holland, New York, 1976.
7. M.J. Carpano. Automatic display of hierarchized graphs for computer aided decision analysis. IEEE Transactions on Systems, Man and Cybernetics, SMC-10(11):705-715, 1980.
8. N. Chiba, K. Onoguchi, and T. Nishizeki. Drawing planar graphs nicely. Acta Informatica, 22:187-201, 1985.
9. N. Chiba, T. Yamanouchi, and T. Nishizeki. Linear algorithms for convex drawings of planar graphs. In J.A. Bondy and U.S.R. Murty, editors, Progress in Graph Theory, pages 153-173. Academic Press, New York, 1984.
10. M. Chrobak and T.H. Payne. A linear time algorithm for drawing a planar graph on a grid. Information Processing Letters, 54:241-246, 1995.
11. P. Eades and Q. Feng. Drawing clustered graphs on an orthogonal grid. In G. Di Battista, editor, Graph Drawing 1997, pages 146-157. Volume 1353 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1998.
12. P. Eades, Q. Feng, and H. Nagamochi. Drawing clustered graphs on the orthogonal grid. Journal of Graph Algorithms and Applications, 3(4):3-29, 1999.
13. P. Eades and X. Lin. How to draw directed graphs. In Proceedings of IEEE Workshop on Visual Languages (VL '89), pages 13-17, 1989.
14. P. D. Eades, X. Lin, and R. Tamassia. An algorithm for drawing a hierarchical graph. International Journal of Computational Geometry and Applications, 6(1): 145-156, 1996.
15. P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, pages 424-437, 1991.
16. S. Even. Graph Algorithms. Computer Science Press, Rockville, MD, 1979.
17. S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339-344, 1976.
18. I. Fary. On straight lines representation of planar graphs. Acta Universitatis Szegediensis. Acta Scientiarum Mathematicarum, 11:229-233, 1948.
19. Q. Feng. Algorithms for Drawing Clustered Graphs. Ph.D. thesis, Department of Computer Science and Software Engineering, University of Newcastle, Newcastle, Queensland, 1997.
20. Q. Feng, R. Cohen, and P. Eades. How to draw a planar clustered graph. In COCOON '95, pages 21-31. Volume 959 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
21. Q. Feng, R. Cohen, and P. Eades. Planarity for clustered graphs. In ESA '95, pages 213-226. Volume 979 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
22. Q. Feng, P. Eades, and R. F. Cohen. Clustered Graphs and C-Planarity. Technical Report 95-04, Department of Computer Science, The University of Newcastle, Newcastle, Queensland, 1995.
23. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41-51, 1990.
24. E.R. Gansner, S.C. North, and K.P. Vo. Dag - a program that draws directed graphs. Software - Practice and Experience, 18(11):1047-1062, 1988.
25. C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, and R. Weikircher. Advances in c-planarity testing of clustered graphs. In Proceedings of 10th International Symposium on Graph Drawing, pages 220-235, 2002.
26. D. Harel. On visual formalisms. Communications of the ACM, 31(5):514-530, 1988.
27. D. Harel and R. Tarjan. Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing, 13:338-355, 1984.
28. M. Himsolt. Graphed: an interactive graph editor. In Proceedings STACS 89, pages 532-533. Volume 349 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1989.
29. M. Jünger, S. Leipert, and P. Mutzel. Pitfalls of using PQ-trees in automatic graph drawing. In G. Di Battista, editor, Graph Drawing 1997, pages 193-204. Volume 1353 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1998.
30. M. Jünger, S. Leipert, and M. Percan. Triangulating Clustered Graphs. Technical report, 2002.
31. T. Kamada. Visualizing Abstract Objects and Relations. World Scientific Series in Computer Science. World Scientific, River Edge, NJ, 1989.
32. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4-32, 1996.
33. M. Kaufmann and D. Wagner. Drawing Graphs, Methods and Models. Springer-Verlag, New York, 2001.
34. J. Kawakita. The KJ Method - A Scientific Approach to Problem Solving. Technical report, Kawakita Research Institute, Tokyo, 1975.
35. W. Lai. Building Interactive Digram Applications. Ph.D. thesis, Department of Computer Science, University of Newcastle, Newcastle, Queensland, 1993.
36. T. Lengauer. Hierarchical planarity testing algorithms. Journal of ACM, 36:474-509, 1989.
37. X. Lin. Analysis of Algorithms for Drawing Graphs. Ph.D. thesis, Department of Computer Science, University of Queensland, Brisbane, Queensland, 1992.
38. M. May and P. Mennecke. Layout of schematic drawings. Systems Analysis Modelling Simulation, 1(4):307-338, 1984.
39. F.P. Preparata and M.I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.
40. H. Purchase. Which aesthetic has the greatest effect on human understanding? In G. Di Battista, editor, Graph Drawing 1997, pages 248-261. Volume 1353 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1998.
41. H.C. Purchase, R.F. Cohen, and M. James. Validating graph drawing aesthetics. In Franz J. Brandenburg, editor, GD '95, pages 435-446. Volume 1027 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
42. R. Read. Methods for Computer Display and Manipulation of Graphs and the Corresponding Algorithms. Technical Report 86-12, Faculty of Mathematics, University of Waterloo, Waterloo, Ontario, July 1986.
43. L.A. Rowe, M. Davis, E. Messinger, C. Meyer, C. Spirakis, and A. Tuan. A browser for directed graphs. Software - Practice and Experience, 17(1):61-76, 1987.
44. Tom Sawyer Software. Graph layout toolkit user's guide. Berkeley, CA, 1996.
45. B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. SIAM Journal on Computing, 17:1253-1262, 1988.
46. W. Schnyder. Embedding planar graphs on the grid. In Proceedings of the First ACM-SIAM Symposium on Discrete Algorithms, pages 138-148, 1990.
47. S.K. Stein. Convex maps. Proceedings of the American Mathematical Society, 2:464-466, 1951.
48. K. Sugiyama. A cognitive approach for graph drawing. Cybernetics and Systems: An International Journal, 18:447-488, 1987.
49. K. Sugiyama and K. Misue. Visualization of structural information: automatic drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics, 21(4):876-892, 1991.
50. K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical systems. IEEE Transactions on Systems, Man and Cybernetics, SMC-11(2): 109-125, 1981.
51. R. Tamassia, G. Di Battista, and C. Batini. Automatic graph drawing and readability of diagrams. IEEE Transactions on Systems, Man and Cybernetics, SMC-18(1):61-79, 1988.
52. W.T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, 3(13):743-768, 1963.
53. K. Wagner. Bemerkungen zum vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung, 46:26-32, 1936.
54. C. Williams, J. Rasure, and C. Hansen. The state of the art of visual languages for visualization. In Visualization 92, pages 202-209, 1992.
55. R. Wirfs-Brock, B. Wilkerson, and L. Wiener. Designing Object-Oriented Software. Prentice-Hall, Englewood Cliffs, NJ, 1990.