Sciweavers

61
Voted
WG
2004
Springer
15 years 2 months ago
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 si...
Michael Baur, Ulrik Brandes