Completely connected clustered graphs

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

Volumn 2880, Issue , 2003, Pages 168-179

  Cornelsen, Sabine ^a   Wagner, Dorothea ^b  

^a UNIVERSITY OF L'AQUILA   (Italy)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; GRAPHIC METHODS;

CLUSTERED GRAPH; CONNECTED SUBGRAPH; PLANAR DRAWING; UNDERLYING GRAPHS;

TREES (MATHEMATICS);

EID: 0345686492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-39890-5_15     Document Type: Article

References (21)

1. F. Bertault and M. Miller. An algorithm for drawing compound graphs. In J. Kratochvíl, editor, Proceedings of the 7th International Symposium on Graph Drawing (GD '99), volume 1731 of Lecture Notes in Computer Science, pages 197-204. Springer, 1999.
2. U. Brandes, S. Cornelsen, and D. Wagner. How to draw the minimum cuts of a planar graph. In J. Marks, editor, Proceedings of the 8th International Symposium on Graph Drawing (GD 2000), volume 1984 of Lecture Notes in Computer Science, pages 103-114. Springer, 2001.
3. S. Cornelsen. Drawing Families of Cuts in a Graph. PhD thesis, Universität Konstanz, 2003. http://www.ub.uni-konstanz.de/kops/volltexte/2003/975/.
4. E. Dahlhaus. A linear time algorithm to recognize clustered planar graphs and its parallelization. In C. L. Lucchesi and A. V. Moura, editors, Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN '98), volume 1380 of Lecture Notes in Computer Science, pages 239-248. Springer, 1998.
5. G. Di Battista, W. Didirao, and A. Marcandalli. Planarization of clustered graphs. In M. Jünger and P. Mutzel, editors, Proceedings of the 9th International Symposium on Graph Drawing (GD 2001), volume 2265 of Lecture Notes in Computer Science, pages 60-74. Springer, 2002.
6. P. Eades, R. F. Cohen, and Q. Feng. How to draw a planar clustered graph. In D.-Z. Du and M. Li, editors, Proceedings of the 1st Annual International Conference on Coputing and Combinatorics (COCOON '95), volume 959 of Lecture Notes in Computer Science, pages 21-30. Springer, 1995.
7. P. Eades and Q. Feng. Multilevel visualization of clustered graphs. In North [18], pages 101-112.
8. P. Eades, Q. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In North [18], pages 146-157.
9. P. Eades, Q. Feng, and H. Nagamochi. Drawing clustered graphs on an orthogonal grid. Journal on Graph Algorithms and Applications, 3(4):3-29, 1999.
10. P. Eades, H. Nagamochi, and 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.
11. Q. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. In P. Spirakis, editor, Proceedings of the 3rd European Symposium on Algorithms (ESA '95), volume 979 of Lecture Notes in Computer Science, pages 213-226. Springer, 1995.
12. M. T. Goodrich and S. G. Kobourov, editors. Proceedings of the 10th International Symposium on Graph Drawing (GD 2002), volume 2528 of Lecture Notes in Computer Science. Springer, 2002.
13. C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, and R. Weiskircher. Advances in c-planarity testing of clustered graphs. In Goodrich and Kobourov [12], pages 220-235.
14. M. L. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs. In S. H. Whitesides, editor, Proceedings of the 6th International Symposium on Graph Drawing (GD '98), volume 1547 of Lecture Notes in Computer Science, pages 374-383. Springer, 1998.
15. M. Jünger, S. Leipert, and M. Percan. Triangulating clustered graphs. Technical Report zaik2002-444, Zentrum für Angewandte Informatik Köln, 2002. Available at http://www.zaik.uni-koeln.de/%7Epaper/preprints.html?show-zaik2002-444.
16. G. Kant and H. L. Bodlaender. Planar graph augmentation problems. In F. Dehne, J.-R. Sack, and N. Santoro, editors, Algorithms and Data Structures, 2nd Workshop (WADS '91), volume 519 of Lecture Notes in Computer Science, pages 286-298. Springer, 1991.
17. D. Lütke-Hüttmann. Knickminimales Zeichnen 4-planarer Clustergraphen. Master's thesis, Universität des Saarlandes, 1999. (Diplomarbeit).
18. S. C. North, editor. Proceedings of the 4th International Symposium on Graph Drawing (GD '96), volume 1190 of Lecture Notes in Computer Science. Springer, 1996.
19. M. Raitner. HGV: A library for hierarchies, graphs, and views. In Goodrich and Kobourov [12], pages 236-243.
20. K. Sugiyama and K. Misue. Visualization of structural information: Automativ drawing of compound digraphs. IEEE Transactions on Systems, Man and Cybernetics, 21:876-892, 1991.
21. X. Wang and I. Miyamoto. Generating customized layouts. In F. J. Brandenburg, editor, Proceedings of the 3rd International Symposium on Graph Drawing (GD '95), volume 1027 of Lecture Notes in Computer Science, pages 504-515. Springer, 1996.