On embedding a cycle in a plane graph

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

Volumn 3843 LNCS, Issue , 2006, Pages 49-60

  Cortese, Pier Francesco ^a   Di Battista, Giuseppe ^a   Patrignani, Maurizio ^a   Pizzonia, Maurizio ^a  

^a ROMA TRE UNIVERSITY   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

NON-CONNECTED CLUSTERED GRAPHS; POLYNOMIAL TIME;

NUMERICAL ANALYSIS; POLYNOMIALS; PROBLEM SOLVING;

GRAPH THEORY;

EID: 33745665075     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_5     Document Type: Conference Paper

References (13)

1. T. C. Biedl. Drawing planar partitions III: Two constrained embedding problems. Tech. Report RRR 13-98, RUTCOR Rutgen University, 1998.
2. 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.
3. 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.
4. P. F. Cortese and G. Di Battista. Clustered planarity. In SCG '05: Proceedings of the twenty-first annual symposium on Computational geometry, pages 32-34, New York, NY, USA, 2005. ACM Press.
5. P. F. Cortese, G. Di Battista, M. Patrignani, and M. Pizzonia. Clustering cycles into cycles of clusters. In János Pach, editor, Proc. Graph Drawing 2004 (GD'04), volume 3383 of LNCS, pages 100-110. Springer-Verlag, 2004.
6. E. Dahlnaus. Linear time algorithm to recognize clustered planar graphs and its parallelization. In C.L. 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.
7. 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.
8. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 1999.
9. S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979.
10. Q. W. Feng, R. F. Cohen, and P. Eades. How to draw a planar clustered graph. In Ding-Zhu Du and Ming Li, editors, Proc. COCOON'95, volume 959 of LNCS, pages 21-30. Springer-Verlag, 1995.
11. 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.
12. C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, and René Weiskircher. Advances in C-planarity testing of clustered graphs. In Stephen G. Kobourov and Michael T. Goodrich, editors, Proc. Graph Drawing 2002 (GD'02), volume 2528 of LNCS, pages 220-235. Springer-Verlag, 2002.
13. T. Lengauer. Hierarchical planarity testing algorithms. J. ACM, 36(3):474-509, 1989.