Completely connected clustered graphs

Journal of Discrete Algorithms

Volumn 4, Issue 2, 2006, Pages 313-323

  Cornelsen, Sabine ^a   Wagner, Dorothea ^b  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

Clustered graphs; Graph drawing; Planar graphs

Indexed keywords

COMPUTER GRAPHICS; DRAWING (GRAPHICS); HIERARCHICAL SYSTEMS; PROGRAMMING THEORY;

CLUSTERED GRAPHS; GRAPH DRAWING; PLANAR GRAPHS; SUBGRAPH;

GRAPH THEORY;

EID: 33747769009     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2005.06.002     Document Type: Article

References (23)

1. Bertault F., and Miller M. An algorithm for drawing compound graphs. In: Kratochvíl J. (Ed). Proceedings of the 7th International Symposium on Graph Drawing (GD '99). Lecture Notes in Comput. Sci. vol. 1731 (1999), Springer, Berlin 197-204
2. Brandes U., Cornelsen S., and Wagner D. Characterizing families of cuts that can be represented by axis-parallel rectangles. In: Liotta G. (Ed). Proceedings of the 11th International Symposium on Graph Drawing (GD 2003). Lecture Notes in Comput. Sci. vol. 2912 (2004), Springer, Berlin 357-368
3. Brandes U., Cornelsen S., and Wagner D. How to draw the minimum cuts of a planar graph. Computational Geometry 29 (2004) 117-133
4. Cornelsen S. Drawing families of cuts in a graph. PhD thesis, Universität Konstanz (2003). http://www.ub.uni-konstanz.de/kops/volltexte/2003/975/
5. Cornelsen S., and Wagner D. Completely connected clustered graphs. In: Bodlaender H.L. (Ed). Graph Theoretic Concepts in Computer Science, 29th International Workshop (WG 2003). Lecture Notes in Comput. Sci. vol. 2880 (2003), Springer, Berlin 168-179
6. Dahlhaus E. A linear time algorithm to recognize clustered planar graphs and its parallelization. In: Lucchesi C.L., and Moura A.V. (Eds). Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN '98). Lecture Notes in Comput. Sci. vol. 1380 (1998), Springer, Berlin 239-248
7. Di Battista G., Didimo W., and Marcandalli A. Planarization of clustered graphs. In: Jünger M., and Mutzel P. (Eds). Proceedings of the 9th International Symposium on Graph Drawing (GD 2001). Lecture Notes in Comput. Sci. vol. 2265 (2002), Springer, Berlin 60-74
8. Eades P., Cohen R.F., and Feng Q. How to draw a planar clustered graph. In: Du D.-Z., and Li M. (Eds). Proceedings of the 1st Annual International Conference on Computing and Combinatorics (COCOON '95). Lecture Notes in Comput. Sci. vol. 959 (1995), Springer, Berlin 21-30
9. P. Eades, Q. Feng, Multilevel visualization of clustered graphs, in: [20], pp. 101-112
10. P. Eades, Q. Feng, X. Lin, Straight-line drawing algorithms for hierarchical graphs and clustered graphs, in: [20], pp. 146-157
11. Eades P., Feng Q., and Nagamochi H. Drawing clustered graphs on an orthogonal grid. J. Graph Algorithms Appl. 3 4 (1999) 3-29
12. P. Eades, H. Nagamochi, Q. Feng, Straight-line drawing algorithms for hierarchical graphs and clustered graphs, Technical Report 98-03, Department of Computer Science and Software Engineering, University of Newcastle, Australia, 1998, available at ftp://ftp.cs.newcastle.edu.au/pub/techreports/tr98-03.ps.Z
13. Feng Q., Cohen R.F., and Eades P. Planarity for clustered graphs. In: Spirakis P. (Ed). Proceedings of the 3rd European Symposium on Algorithms (ESA '95). Lecture Notes in Comput. Sci. vol. 979 (1995), Springer, Berlin 213-226
14. In: Goodrich M.T., and Kobourov S.G. (Eds). Proceedings of the 10th International Symposium on Graph Drawing (GD 2002). Lecture Notes in Comput. Sci. vol. 2528 (2002), Springer, Berlin
15. C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, R. Weiskircher, Advances in c-planarity testing of clustered graphs, in: [14], pp. 220-235
16. Huang M.L., and Eades P. A fully animated interactive system for clustering and navigating huge graphs. In: Whitesides S.H. (Ed). Proceedings of the 6th International Symposium on Graph Drawing (GD '98). Lecture Notes in Comput. Sci. vol. 1547 (1998), Springer, Berlin 374-383
17. Jünger M., Leipert S., and Percan M. Triangulating clustered graphs. Technical Report zaik2002-444, Zentrum für Angewandte Informatik Köln (2000). http://www.zaik.uni-koeln.de/%7Epaper/preprints.html?show=zaik2002-444
18. Kant G., and Bodlaender H.L. Planar graph augmentation problems. In: Dehne F., Sack J.-R., and Santoro N. (Eds). Algorithms and Data Structures, 2nd Workshop (WADS '91). Lecture Notes in Comput. Sci. vol. 519 (1991), Springer, Berlin 286-298
19. D. Lütke-Hüttmann, Knickminimales Zeichnen 4-planarer Clustergraphen, Master's thesis, Universität des Saarlandes, 1999 (Diplomarbeit)
20. In: North S.C. (Ed). Proceedings of the 4th International Symposium on Graph Drawing (GD '96). Lecture Notes in Comput. Sci. vol. 1190 (1996), Springer, Berlin
21. M. Raitner, HGV: A library for hierarchies and views, in: [14], pp. 236-243
22. Sugiyama K., and Misue K. Visualization of structural information: Automotive drawing of compound digraphs. IEEE Trans. Systems Man Cybernet. 21 (1991) 876-892
23. Wang X., and Miyamoto I. Generating customized layouts. In: Brandenburg F.J. (Ed). Proceedings of the 3rd International Symposium on Graph Drawing (GD '95). Lecture Notes in Comput. Sci. vol. 1027 (1996), Springer, Berlin 504-515