Clustering Cycles into Cycles of Clusters

  • Pier Francesco Cortese
  • Giuseppe Di Battista
  • Maurizio Patrignani
  • Maurizio Pizzonia
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3383)


In this paper we study the clustered graphs whose underlying graph is a cycle. This is a simple family of clustered graphs that are “highly non connected”. We start by studying 3-cluster cycles, that are clustered graphs such that the underlying graph is a simple cycle and there are three clusters all at the same level. We show that in this case testing the c-planarity can be done efficiently and give an efficient drawing algorithm. Also, we characterize 3-cluster cycles in terms of formal grammars. Finally, we generalize the results on 3-cluster cycles considering clustered graphs that at each level of the inclusion tree have a cycle structure. Even in this case we show efficient c-planarity testing and drawing algorithms.


  1. 1.
    Biedl, T., Kaufmann, M., Mutzel, P.: Drawing planar partitions II: HH-drawings. In: Hromkovič, J., Sýkora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 124–136. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  2. 2.
    Biedl, T.C.: Drawing planar partitions III: Two constrained embedding problems. Tech. Report RRR 13-98, RUTCOR Rutgen University (1998)Google Scholar
  3. 3.
    Cornelsen, S., Wagner, D.: Completely connected clustered graphs. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 168–179. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  4. 4.
    Cortese, P.F., Di Battista, G., Patrignani, M., Pizzonia, M.: Clustering cycles into cycles of clusters. Technical Report RT-DIA-91-2004, Dipartimento di Informatica e Automazione, Universit‘a di Roma Tre, Rome, Italy (2004)Google Scholar
  5. 5.
    Di Battista, G., Didimo, W., Marcandalli, A.: Planarization of clustered graphs. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 60–74. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing. Prentice Hall, Upper Saddle River (1999)Google Scholar
  7. 7.
    Even, S.: Graph Algorithms. Computer Science Press, Potomac (1979)Google Scholar
  8. 8.
    Feng, Q.W., Cohen, R.F., Eades, P.: How to draw a planar clustered graph. In: Du, D.-Z., Li, M. (eds.) COCOON 1995. LNCS, vol. 959, pp. 21–30. Springer, Heidelberg (1995)CrossRefGoogle Scholar
  9. 9.
    Feng, Q.W., Cohen, R.F., Eades, P.: Planarity for clustered graphs. In: Spirakis, P. (ed.) ESA 1995. LNCS, vol. 979, pp. 213–226. Springer, Heidelberg (1995)Google Scholar
  10. 10.
    Gutwenger, C., Jünger, M., Leipert, S., Mutzel, P., Percan, M., Weiskircher, R.: Advances in C-planarity testing of clustered graphs. In: Kobourov, S.G., Goodrich, M.T. (eds.) GD 2002. LNCS, vol. 2528, pp. 220–235. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  11. 11.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Pier Francesco Cortese
    • 1
  • Giuseppe Di Battista
    • 1
  • Maurizio Patrignani
    • 1
  • Maurizio Pizzonia
    • 1
  1. 1.Dipartimento di Informatica e AutomazioneUniversità Roma TreItaly

Personalised recommendations