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 , pp. 197-204(Official URL: http://dx.doi.org/10.1007/3-540-46648-7_20).

Full text not available from this repository.

Abstract

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
URI: http://gdea.informatik.uni-koeln.de/id/eprint/328

Actions (login required)

View Item View Item