Abstract
We consider the problem of partitioning a directed acyclic graph into layers such that all edges point unidirectionally. We perform an experimental analysis of some of the existing layering algorithms and then propose a new algorithm that is more realistic in the sense that it is possible to incorporate specific information about node and edge widths into the algorithm. The goal is to minimize the total sum of edge spans subject to dimension constraints on the drawing. We also present some preliminary results from experiments we have conducted using our layering algorithm on over 5900 example directed acyclic graphs.
Chapter PDF
Similar content being viewed by others
References
G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications, (7):303–316, 1997.
Fr. Brandenburg, Ul. Brandes, M. Himsolt, and M. Raitner. Graph-drawing contest report. In Joe Marks, editor, Graph Drawing: Proceedings of 8th International Symposium, GD 2000, pages 410–418. Springer-Verlag, 2000.
E. G. Coffman and R. L. Graham. Optimal scheduling for two processor systems. Acta Informatica, 1:200–213, 1972.
P. Eades and K. Sugiyama. How to draw a directed graph. Journal of Information Processing, 13(4):424–437, 1990.
E. Gansner, E. Koutsofios, S. North, and K. Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(3):214–229, March 1993.
K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man, and Cybernetics, SMC-11(2):109–125, February 1981.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Healy, P., Nikolov, N.S. (2002). How to Layer a Directed Acyclic Graph. In: Mutzel, P., Jünger, M., Leipert, S. (eds) Graph Drawing. GD 2001. Lecture Notes in Computer Science, vol 2265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45848-4_2
Download citation
DOI: https://doi.org/10.1007/3-540-45848-4_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43309-5
Online ISBN: 978-3-540-45848-7
eBook Packages: Springer Book Archive