An Algorithm for Drawing Compound Graphs

Bertault, François and Miller, Mirka (1999) An Algorithm for Drawing Compound Graphs. In: Graph Drawing 7th International Symposium, GD’99, September 15-19, 1999, Štirín Castle, Czech Republic , pp. 197-204 (Official URL:

Full text not available from this repository.


We present a new algorithm, called NUAGE, for drawing graphs with both adjacency and inclusion relationships between nodes, that is, compound graphs. Compound graphs are more general than classical graph models or clustered graphs. NUAGE can be applied to both directed and undirected compound graphs. It can be parameterized by classical graph drawing algorithms. NUAGE can be viewed as a method for unifying several classical algorithms within the same drawing by using the structure of the compound graph. Additionally, we present a refinement technique that can be used in conjunction with NUAGE to reduce the number of edge crossings.

Item Type:Conference Paper
Additional Information:10.1007/3-540-46648-7_20
Classifications:M Methods > M.999 Others
G Algorithms and Complexity > G.420 Crossings
P Styles > P.240 Compound
G Algorithms and Complexity > G.350 Clusters
ID Code:328

Repository Staff Only: item control page


G. Di Battista, P. D. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography,. Computational Geometry: theory and applications, 4(5):235-282, 1994.

P. D. Eades and Q.-W. Feng. Multilevel visualisation of clustered graphs. In S. North, editor, Graph drawing, volume 1190, pages 101-111, Berkeley (USA), 1996. Springer-Verlag.

P. D. Eades, Q.-W. Feng, and X. Lin. Straight-line drawing algorithms for hierarchical graphs and clustered graphs. In S. North, editor, Graph Drawing, volume 1190, pages 113-127, Berkeley (USA), 1996. Springer-Verlag.

T. Fruchterman and E. Reingold. Graph drawing by force-directed placement. Software-Practice and Experience, 21(11):1129-1164, 1991.

D. Harel. On visual formalisms. Communications of the ACM, 31(5):514-530, 1988.

S. C. North. Drawing ranked digraphs with recursive clusters. ALCOM Workshop on Graph Drawing 93, 1993.

E. M. Reingold and J. S. Tilford. Tidier drawings of trees. IEEE Transactions on Software Engineering, SE-7(2):223-228, March 1981.

K. Sugiyama and K. Misue. Visualisation of structural information: automatic drawing of compound digraphs. IEEE Trans. SMC, 4(21):876-893, 1991.

K. Sugiyama and K. Misue. A generic compound graph visualizer/manipulator: D-Abductor. In F. J. Brandenburg, editor, Graph Drawing, volume 1027 of Lecture Notes in Computer Science, pages 500-503, Passau (Allemagne), 1995. Springer Verlag.