Multilevel visualization of clustered graphs

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

Volumn 1190, Issue , 1997, Pages 101-112

  Eades, Peter ^a   Feng, Qing Wen ^a  

^a UNIVERSITY OF NEWCASTLE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; DRAWING (GRAPHICS); GRAPHIC METHODS; REVERSE ENGINEERING;

CLUSTERED GRAPH; CONVEX DRAWINGS; DRAWING ALGORITHMS; LAYOUT ALGORITHMS; TWO DIMENSIONAL PLANE; VLSI DESIGN TOOLS;

INFORMATION MANAGEMENT;

EID: 84957692275     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-62495-3_41     Document Type: Conference Paper

References (16)

1. G. Di Battista and R. Tamassia. Algorithms for plane representations of acyclic digraphs. Theoretical Computer Science, 61:175-198, 1988.
2. G. Di Battista, R. Tamassia, and I.G. Tollis. Constrained visibility representations of graphs. Information Processing Letters, 41:1-7, 1992.
3. Peter Eades and Qing-Wen Feng. Orthogonal grid drawing of clustered graphs. Technical Report 96-04, Department of Computer Science, The University of Newcastle, Australia, 1996.
4. Peter Eades, Qing-Wen Feng, and Xuemin Lin. Straight-fine drawing algorithms for hierarchical graphs and clustered graphs. Technical Report 96-02, Department of Computer Science, The University of Newcastle, Australia, 1996.
5. S. Even and R. E. Tarjan. Computing an st-numbering. Theoretical Computer Science, 2:339-344, 1976.
6. Qing-Wen Feng, Robert F. Cohen, and Peter Eades. How to draw a planar clustered graph. In COCOON ’95, volume 959 of Lecture Notes in Computer Science, pages 21-31. Springer-Verlag, 1995.
7. D. Harel. On visual formalisms. Communications of the ACM, 31(5):514-530, 1988.
8. J. Kawakita. The KJ method – a scientific approach to problem solving. Technical report, Kawakita Research Institute, Tokyo, 1975.
9. Brendan Madden, Patrick Madden, Steve Powers, and Michael Himsolt. Portable graph layout and editing. In GD’95, volume 1027 of Lecture Notes in Computer Science, pages 385-395. Springer-Verlag.
10. K. Misue and K. Sugiyama. An overview of diagram based idea organizer: Dabductor. Technical Report IIAS-RR-93-3E, ISIS, Fujitsu Laboratories, 1993.
11. Stephen C. North. Drawing ranked digraphs with recursive clusters. In Proc. ALCOM Workshop on Graph Drawing '93, September 1993.
12. Tom Sawyer Software. Graph layout toolkit, available from bmadden@TomSawyer.COM.
13. 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.
14. 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.
15. W. T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, 3(13):743-768, 1963.
16. C. Williams, J. Rasure, and C. Hansen. The state of the art of visual languages for visualization. In Visualization 92, pages 202–209, 1992.