Clustering cycles into cycles of clusters extended abstract

Lecture Notes in Computer Science

Volumn 3383, Issue , 2004, Pages 100-110

  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

ALGORITHMS; COMPUTER SCIENCE; DRAWING (GRAPHICS); TREES (MATHEMATICS); COMPUTATIONAL GRAMMARS; GRAPHIC METHODS;

C-PLANARITY TESTING; CLUSTERING CYCLES; DRAWING ALGORITHMS; UNDERLYING GRAPHS;

GRAPH THEORY;

C-PLANARITY TESTING; CLUSTERED GRAPH; CLUSTERING CYCLES; CYCLE STRUCTURES; DRAWING ALGORITHMS; EXTENDED ABSTRACTS; FORMAL GRAMMARS; UNDERLYING GRAPHS;

EID: 24144438620     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. T. 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. T. C. Biedl. Drawing planar partitions III: Two constrained embedding problems. Tech. Report RRR 13-98, RUTCOR Rutgen University, 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, G. Di Battista, M. Patrignani, and M. Pizzonia. Clustering cycles into cycles of clusters. Technical Report RT-DIA-91-2004, Dipartimento di Informatica e Automazione, Università di Roma Tre, Rome, Italy, 2004.
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. S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979.
8. 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.
9. 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.
10. C. Gutwenger, M. Jünger, S. Leipert, P. Mutzel, M. Percan, and R. 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.
11. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.