Geodesic
Clustering Cycles into Cycles of Clusters
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Twelfth International Symposium on Graph Drawing, GD 2004 , Tome 9 (2005) no. 3, pp. 391-413.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which 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 have a cycle structure at each level of the inclusion tree. We present efficient c-planarity testing and drawing algorithms also for this case. 
@article{JGAA_2005_9_3_a5,
     author = {Pier Francesco Cortese and Giuseppe Di Battista and Maurizio Patrignani and Maurizio Pizzonia},
     title = {Clustering {Cycles} into {Cycles} of {Clusters}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {391--413},
     publisher = {mathdoc},
     volume = {9},
     number = {3},
     year = {2005},
     doi = {10.7155/jgaa.00115},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00115/}
}
TY  - JOUR
AU  - Pier Francesco Cortese
AU  - Giuseppe Di Battista
AU  - Maurizio Patrignani
AU  - Maurizio Pizzonia
TI  - Clustering Cycles into Cycles of Clusters
JO  - Journal of Graph Algorithms and Applications
PY  - 2005
SP  - 391
EP  - 413
VL  - 9
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00115/
DO  - 10.7155/jgaa.00115
LA  - en
ID  - JGAA_2005_9_3_a5
ER  - 
%0 Journal Article
%A Pier Francesco Cortese
%A Giuseppe Di Battista
%A Maurizio Patrignani
%A Maurizio Pizzonia
%T Clustering Cycles into Cycles of Clusters
%J Journal of Graph Algorithms and Applications
%D 2005
%P 391-413
%V 9
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00115/
%R 10.7155/jgaa.00115
%G en
%F JGAA_2005_9_3_a5
Pier Francesco Cortese; Giuseppe Di Battista; Maurizio Patrignani; Maurizio Pizzonia. Clustering Cycles into Cycles of Clusters. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Twelfth International Symposium on Graph Drawing, GD 2004
					, Tome 9 (2005) no. 3, pp. 391-413. doi : 10.7155/jgaa.00115. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00115/

Cité par Sources :