Crossing Reduction in Circular Layouts

We propose a two-phase heuristic for crossing reduction in circular layouts. While the first algorithm uses a greedy policy to build a good initial layout, an adaptation of the sifting heuristic for crossing reduction in layered layouts is used for local optimization in the second phase. Both phases are conceptually simpler than previous heuristics, and our extensive experimental results indicate that they also yield fewer crossings. An interesting feature is their straightforward generalization to the weighted case.

• Type: Conference
• Year: 2004
• Where: WG
• Authors: Michael Baur, Ulrik Brandes
• Keywords: Circular Layouts, Computer Science, Layered Layouts, WG 2004, first Algorithm