Home  Issues  Aims and Scope  Instructions for Authors 
DOI: 10.7155/jgaa.00340
Multilayer Drawings of Clustered Graphs
Vol. 18, no. 5, pp. 633675, 2014. Regular paper.
Abstract The cluster adjacency graph of a flat clustered graph C(G,T) is the graph A whose vertices are the clusters in T and whose edges connect clusters containing vertices that are adjacent in G. A multilayer drawing of a clustered graph C consists of a straightline cplanar drawing of C in which the clusters are drawn as convex regions and of a straightline planar drawing of A such that each vertex a ∈ A is drawn in the cluster corresponding to a and such that no edge (a_{1},a_{2}) ∈ A intersects any cluster different from a_{1} and a_{2}. In this paper, we show that every cplanar flat clustered graph admits a multilayer drawing.

Submitted: November 2012.
Reviewed: February 2014.
Revised: April 2014.
Accepted: November 2014.
Final: December 2014.
Published: December 2014.
Communicated by
Antonios Symvonis
