Overlapping Cluster Planarity
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the 6th Asia-Pacific Symposium on Visualisation, APVIS 2007 , Tome 12 (2008) no. 3, pp. 267-291.

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

This paper investigates a new direction in the area of cluster planarity by addressing the following question: Let G be a graph along with a hierarchy of vertex clusters, where clusters can partially intersect. Does G admit a drawing where each cluster is inside a simple closed region, no two edges intersect, and no edge intersects a region twice? We investigate the interplay between this problem and the classical cluster planarity testing problem where clusters are not allowed to partially intersect. Characterizations, models, and algorithms are discussed.
@article{JGAA_2008_12_3_a1,
     author = {Walter Didimo and Francesco Giordano and Giuseppe Liotta},
     title = {Overlapping {Cluster} {Planarity}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {267--291},
     publisher = {mathdoc},
     volume = {12},
     number = {3},
     year = {2008},
     doi = {10.7155/jgaa.00167},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00167/}
}
TY  - JOUR
AU  - Walter Didimo
AU  - Francesco Giordano
AU  - Giuseppe Liotta
TI  - Overlapping Cluster Planarity
JO  - Journal of Graph Algorithms and Applications
PY  - 2008
SP  - 267
EP  - 291
VL  - 12
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00167/
DO  - 10.7155/jgaa.00167
LA  - en
ID  - JGAA_2008_12_3_a1
ER  - 
%0 Journal Article
%A Walter Didimo
%A Francesco Giordano
%A Giuseppe Liotta
%T Overlapping Cluster Planarity
%J Journal of Graph Algorithms and Applications
%D 2008
%P 267-291
%V 12
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00167/
%R 10.7155/jgaa.00167
%G en
%F JGAA_2008_12_3_a1
Walter Didimo; Francesco Giordano; Giuseppe Liotta. Overlapping Cluster Planarity. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the 6th Asia-Pacific Symposium on Visualisation, APVIS 2007
					, Tome 12 (2008) no. 3, pp. 267-291. doi : 10.7155/jgaa.00167. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00167/

Cité par Sources :