Invited talk clustered planarity

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 32-34

  Cortese, Pier Francesco ^a   Di Battista, Giuseppe ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

Cluster; Graph Drawing; Planarity

Indexed keywords

EID: 33244492652     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064093     Document Type: Conference Paper

References (17)

1. T. C. Biedl, M. Kaufmann, and P. Mutzel. Drawing planar partitions II: HH-Drawings. In Workshop on Graph-Theoretic Concepts in Computer Science (WG'98), volume 1517, pages 124-136. Springer-Verlag, 1998.
2. S. Cornelsen and D. Wagner. Completely connected clustered graphs. In Proc. 29th Intl. Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), volume 2880 of LNCS, pages 168-179. Springer-Verlag, 2003.
3. P. F. Cortese, G. Di Battista, M. Patrignani, and M. Pizzonia. Clustering cycles into cycles of clusters. In J. Pach, editor, Proc. Graph Drawing 2004 (GD'04), volume 3383 of LNCS, pages 100-110. Springer-Verlag, 2004.
4. E. Dahlhaus. Linear time algorithm to recognize clustered planar graphs and its parallelization. In C. Lucchesi, editor, LATIN '98, 3rd Latin American symposium on theoretical informatics, Campinas, Brazil, April 20-24, 1998, volume 1380 of LNCS, pages 239-248, 1998.
5. G. Di Battista, W. Didimo, and A. Marcandalli. Planarization of clustered graphs. In Proc. Graph Drawing 2001 (GD'01), LNCS, pages 60-74. Springer-Verlag, 2001.
6. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
7. G. Di Battista, W. P. Liu, and I. Rival. Bipartite graphs, upward drawings, and planarity. Information Processign Letters, 36(6):317-322, 1990.
8. C. A. Duncan, M. T. Goodrich, and S. G. Kobourov. Planarity-preserving clustering and embedding for large planar graphs. J. Computational Geometry, 24(2):95-114, 2003.
9. P. Eades and Q. W. Feng. Multilevel visualization of clustered graphs. In S. C. North, editor, Proc. Graph Drawing 1996 (GD'96), volume 1190 of LNCS, pages 101-112. Springer-Verlag, 1997.
10. P. Eades, Q. W. Feng, and X. Lin. Straight line drawing algorithms for hierarchical graphs and clustered graphs. In S. C. North, editor, Proc. Graph Drawing 1996 (GD'96), volume 1190 of LNCS, pages 113-128. Springer-Verlag, 1997.
11. P. Eades, Q.-W. Feng, and H. Nagamochi. Drawing clustered graphs on an orthogonal grid. J. Graph Algorithms Appl., 3(4):3-29, 1999.
12. Q. Feng. Algorithms for Drawing Clustered Graphs. PhD thesis, Department of Computer Science and Software engineering, University of Newclastle, Apr. 1997.
13. Q. W. Feng, R. F. Cohen, and P. Eades. Planarity for clustered graphs. In P. Spirakis, editor, Symposium on Algorithms (Proc. ESA'95), volume 979 of LNCS, pages 213-226. Springer-Verlag, 1995.
14. C. Gutwenger, M. Jnger, S. Leipert, P. Mutzel, M. Percan, and R. Weiskircher. Subgraph induced planar connectivity augmentation. In 29-th Workshop on Graph-Theoretic Concepts in Computer Science (WG 2003), volume 2880 of LNCS, pages 261-272. Springer-Verlag, 2003.
15. C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, and R. Weiskircher. Advances in C-planarity testing of clustered graphs. In S. G. Kobourov and M. T. Goodrich, editors, Proc. Graph Drawing 2002 (GD'02), volume 2528 of LNCS, pages 220-235. Springer-Verlag, 2002.
16. T. Lengauer. Hierarchical planarity testing algorithms. J. ACM, 36(3):474-509, 1989.
17. H. Nagamochi and K. Kuroya, Convex drawing for c-planar biconnected clustered graphs. In G. Liotta, editor, Proc. Graph Drawing 2003 (GD'03), volume 2912 of LNCS, pages 369-380. Springer-Verlag, 2004.