Planarity-preserving clustering and embedding for large planar graphs

Computational Geometry: Theory and Applications

Volumn 24, Issue 2, 2003, Pages 95-114

  Duncan, Christian A ^a   Goodrich, Michael T ^b   Kobourov, Stephen G ^c  

^a Department of Computer Science and Center for Computational Science   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84867962052     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(02)00094-9     Document Type: Article

References (19)

1. H. de Fraysseix, J. Pach, and R. Pollack How to draw a planar graph on a grid Combinatorica 10 1 1990 41 51
2. C.A. Duncan, M.T. Goodrich, and S.G. Kobourov Balanced aspect ratio trees and their use for drawing very large graphs Proceedings of the 6th Symposium on Graph Drawing 1998 111 124
3. C.A. Duncan, M.T. Goodrich, and S.G. Kobourov Planarity-preserving clustering and embedding for large planar graphs Proceedings of the 7th Symposium on Graph Drawing 1999 186 196
4. P. Eades, and Q.-W. Feng Multilevel visualization of clustered graphs Proceedings of the 4th Symposium on Graph Drawing (GD '96) 1996 101 112
5. P. Eades, Q.-W. Feng, and X. Lin Straight-line drawing algorithms for hierarchical graphs and clustered graphs Proceedings of the 4th Symposium on Graph Drawing (GD '96) 1996 113 128
6. I. Fáry On straight lines representation of planar graphs Acta Scientiarum Mathematicarum 11 1948 229 233
7. Q.-W. Feng, R.F. Cohen, and P. Eades How to draw a planar clustered graph Proceedings of the 1st Annual International Conference on Computing and Combinatorics (COCOON '95) 1995 21 31
8. Q.-W. Feng, R.F. Cohen, and P. Eades Planarity for clustered graphs Third Annual European Symposium on Algorithms (ESA '95) 1995 213 226
9. G.W. Furnas Generalized fisheye views Proceedings of ACM Conference on Human Factors in Computing Systems (CHI '86) 1986 16 23
10. K. Kaugars, J. Reinfelds, and A. Brazma A simple algorithm for drawing large graphs on small screens Graph Drawing (GD '94) 1995 278 281
11. R.J. Lipton, and R.E. Tarjan A separator theorem for planar graphs SIAM J. Appl. Math. 36 1979 177 189
12. F.J. Newbery Edge concentration: A method for clustering directed graphs Proceedings of the 2nd International Workshop on Software Configuration Management 1989 76 85
13. S.C. North Drawing ranked digraphs with recursive clusters Graph Drawing, ALCOM International Workshop PARIS on Graph Drawing and Topological Graph Algorithms (GD '93) 1993
14. R. Sablowski, and A. Frick Automatic graph clustering Proc. of 4th Symposium on Graph Drawing (GD '96) Lecture Notes in Computer Science 1190 1996 395 400
15. M. Sarkar, and M.H. Brown Graphical fisheye views Comm. ACM 37 12 1994 73 84
16. W. Schnyder Embedding planar graphs on the grid Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA) 1990 138 148
17. S.K. Stein Convex maps Proc. Amer. Math. Soc. 2 3 1951 464 466
18. K. Sugiyama, and K. Misue Visualization of structural information: Automatic drawing of compound digraphs IEEE Trans. Systems Man Cybernet. 21 4 1991 876 892
19. K. Wagner Bemerkungen zum vierfarbenproblem Jahresbericht der Deutschen Mathematiker-Vereinigung 46 1936 26 32