Clustering cycles into cycles of clusters

Journal of Graph Algorithms and Applications

Volumn 9, Issue 3, 2005, Pages 391-413

  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

C-PLANARITY TESTING; CLUSTERED GRAPH; CLUSTERING CYCLES; CYCLE STRUCTURES; DRAWING ALGORITHMS; PLANARITY; SIMPLE++; TESTING ALGORITHM; UNDERLYING GRAPHS;

TREES (MATHEMATICS);

EID: 34547304098     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00115     Document Type: Article

References (17)

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 of LNCS, 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 Sci-ence (WG 2003), volume 2880 of LNCS, pages 168-179. Springer-Verlag, 2003.
4. E. Dahlhaus. Linear time algorithm to recognize clustered planar graphs and its parallelization. In C. Lucchesi, editor, LATIN '98, 3rd Latin Amer-ican 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), volume 2265 of 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 Processing 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 Geom-etry, 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. S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979.
13. Q. W. Feng, R. F. Cohen, and P. Eades. How to draw a planar clustered graph. In D.-Z. Du and M. Li, editors, Proc. COCOON'95, volume 959 of LNCS, pages 21-30. Springer-Verlag, 1995.
14. 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.
15. M. Freire and P. Rodriguez. A graph-based interface to complex hypermedia structure visualization. In Proceedings of the working conference on Advanced visual interfaces, pages 163-166. ACM Press, 2004.
16. C. Gutwenger, M. J̈unger, 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.
17. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Lan-guages, and Computation. Addison-Wesley, 1979.