Planarization of Clustered Graphs (Extended Abstract)

Di Battista, Giuseppe and Didimo, Walter and Marcandalli, A. (2002) Planarization of Clustered Graphs (Extended Abstract). In: Graph Drawing 9th International Symposium, GD 2001, September 23-26, 2001 , pp. 60-74(Official URL: http://dx.doi.org/10.1007/3-540-45848-4_5).

Full text not available from this repository.

Abstract

We propose a planarization algorithm for clustered graphs and experimentally test its efficiency and effectiveness. Further, we integrate our planarization strategy into a complete topology-shape-metrics algorithm for drawing clustered graphs in the orthogonal drawing convention.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-45848-4_5
Classifications: M Methods > M.800 Topology-shape-metrics
P Styles > P.180 Cluster
G Algorithms and Complexity > G.840 Planarization
G Algorithms and Complexity > G.420 Crossings
P Styles > P.600 Poly-line > P.600.700 Orthogonal
URI: http://gdea.informatik.uni-koeln.de/id/eprint/404

Actions (login required)

View Item View Item