Computer aided layout of entity relationship diagrams
Journal of Systems and Software - Special double issue on the entity-relationship approach to databases and related software
Area requirement and symmetry display of planar upward drawings
Discrete & Computational Geometry
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Width-restricted layering of acyclic digraphs with consideration of dummy nodes
Information Processing Letters
A Technique for Drawing Directed Graphs
IEEE Transactions on Software Engineering
A Fast Layout Algorithm for k-Level Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Fast and Simple Horizontal Coordinate Assignment
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
How to Layer a Directed Acyclic Graph
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
A Branch-and-Cut Approach to the Directed Acyclic Graph Layering Problem
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Graph layering by promotion of nodes
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Layer-free upward crossing minimization
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Crossing minimization and layouts of directed hypergraphs with port constraints
GD'10 Proceedings of the 18th international conference on Graph drawing
GD'09 Proceedings of the 17th international conference on Graph Drawing
An SDP approach to multi-level crossing minimization
Journal of Experimental Algorithmics (JEA)
| Hi-index | 0.00 |
Recently, we presented a new practical method for upward crossing minimization [6], which clearly outperformed existing approaches for drawing hierarchical graphs in that respect. The outcome of this method is an upward planar representation (UPR), a planarly embedded graph in which crossings are represented by dummy vertices. However, straight-forward approaches for drawing such UPRs lead to quite unsatisfactory results. In this paper, we present a new algorithm for drawing UPRs that greatly improves the layout quality, leading to good hierarchal drawings with few crossings. We analyze its performance on well-known benchmark graphs and compare it with alternative approaches.