Dynamic variable ordering for ordered binary decision diagrams
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
LEDA: a platform for combinatorial and geometric computing
LEDA: a platform for combinatorial and geometric computing
Circular Drawings of Biconnected Graphs
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
Circular Layout in the Graph Layout Toolkit
GD '96 Proceedings of the Symposium on Graph Drawing
Book Embeddings and Crossing Numbers
WG '94 Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science
Crossing reduction in circular layouts
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A Radial Adaptation of the Sugiyama Framework for Visualizing Hierarchical Information
IEEE Transactions on Visualization and Computer Graphics
Visual Analysis of One-to-Many Matched Graphs
Graph Drawing
Group-Level Analysis and Visualization of Social Networks
Algorithmics of Large and Complex Networks
Crossing minimization in extended level drawings of graphs
Discrete Applied Mathematics
Visualizing large and clustered networks
GD'06 Proceedings of the 14th international conference on Graph drawing
GD'06 Proceedings of the 14th international conference on Graph drawing
Multi-circular layout of micro/macro graphs
GD'07 Proceedings of the 15th international conference on Graph drawing
Drawing graphs on a smartphone
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'10 Proceedings of the 18th international conference on Graph drawing
Large crossing angles in circular layouts
GD'10 Proceedings of the 18th international conference on Graph drawing
GEOMI: GEOmetry for maximum insight
GD'05 Proceedings of the 13th international conference on Graph Drawing
Crossing reduction in circular layouts
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
A global k-level crossing reduction algorithm
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Grid sifting: Leveling and crossing reduction
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
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.