A mathematical for periodic scheduling problems
SIAM Journal on Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fast and Simple Horizontal Coordinate Assignment
GD '01 Revised Papers from the 9th International Symposium on Graph Drawing
Cyclic Leveling of Directed Graphs
Graph Drawing
Gravisto: graph visualization toolkit
GD'04 Proceedings of the 12th international conference on Graph Drawing
Classification of planar upward embedding
GD'11 Proceedings of the 19th international conference on Graph Drawing
On the curve complexity of upward planar drawings
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
Upward planar drawings on the standing and the rolling cylinders
Computational Geometry: Theory and Applications
Hi-index | 0.01 |
The Sugiyama framework is the most commonly used concept for visualizing directed graphs. It draws them in a hierarchical way and operates in four phases: cycle removal, leveling, crossing reduction, and coordinate assignment. However, there are situations where cycles must be displayed as such, e. g., distinguished cycles in the biosciences and scheduling processes which repeat in a daily or weekly turn. This excludes the removal of cycles. In their seminal paper Sugiyama et al. introduced recurrent hierarchies as a concept to draw graphs with cycles. However, this concept has not received much attention in the following years. In this paper we supplement our cyclic Sugiyama framework and investigate the coordinate assignment phase. We provide an algorithm which runs in linear time and constructs drawings which have at most two bends per edge and use quadratic area.