Abstract
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 processes that repeat in a daily or weekly turn. This forbids the removal of cycles. In their seminal paper Sugiyama et al. also introduced recurrent hierarchies as a concept to draw graphs with cycles. However, this concept has not received much attention since then.
In this paper we investigate the leveling problem for cyclic graphs. We show that minimizing the sum of the length of all edges is \({\mathcal{NP}}\)-hard for a given number of levels and present three different heuristics for the leveling problem. This sharply contrasts the situation in the hierarchical style of drawing directed graphs, where this problem is solvable in polynomial time.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bachmaier, C., Brandenburg, F.J., Forster, M., Holleis, P., Raitner, M.: Gravisto: Graph visualization toolkit. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 502–503. Springer, Heidelberg (2005)
Bachmaier, C., Brunner, W.: Linear time planarity testing and embedding of strongly connected cyclic level graphs. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 136–147. Springer, Heidelberg (2008)
Coffman, E.G., Graham, R.L.: Optimal scheduling for two processor systems. Acta Informatica 1(3), 200–213 (1972)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
Garey, M.R., Johnson, D.S.: A Guide to the Theory of NP-Completeness. W. H. Freemann, New York (1979)
Kaufmann, M., Wagner, D. (eds.): Drawing Graphs. LNCS, vol. 2025. Springer, Heidelberg (2001)
Michal, G. (ed.): Biochemical Pathways: An Atlas of Biochemistry and Molecular Biology. Wiley, New York (1999)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transactions on Systems, Man, and Cybernetics 11(2), 109–125 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bachmaier, C., Brandenburg, F.J., Brunner, W., Lovász, G. (2009). Cyclic Leveling of Directed Graphs. In: Tollis, I.G., Patrignani, M. (eds) Graph Drawing. GD 2008. Lecture Notes in Computer Science, vol 5417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00219-9_34
Download citation
DOI: https://doi.org/10.1007/978-3-642-00219-9_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00218-2
Online ISBN: 978-3-642-00219-9
eBook Packages: Computer ScienceComputer Science (R0)