Applying Crossing Reduction Strategies to Layered Compound Graphs

Forster, Michael (2002) Applying Crossing Reduction Strategies to Layered Compound Graphs. In: Graph Drawing 10th International Symposium, GD 2002, August 26-28, 2002 , pp. 276-284(Official URL: http://dx.doi.org/10.1007/3-540-36151-0_26).

Full text not available from this repository.

Abstract

We present a new method for the application of 2-layer crossing reduction algorithms to layered compound graphs. It is based on an algorithm by Sander [7-9] and improves it with fewer crossings. Our method is optimal in the sense that it does not introduce unnecessary crossings by itself. If used with an optimal 2-layer crossing reduction algorithm, the crossing reduction for 2-layer compound graphs is optimal, too.

Item Type: Conference Paper
Additional Information: 10.1007/3-540-36151-0_26
Classifications: M Methods > M.999 Others
G Algorithms and Complexity > G.999 Others
G Algorithms and Complexity > G.420 Crossings
P Styles > P.480 Layered
P Styles > P.240 Compound
URI: http://gdea.informatik.uni-koeln.de/id/eprint/347

Actions (login required)

View Item View Item