Abstract
The drawing of hierarchical graphs is one of the main areas of research in the field of Graph Drawing. In this paper we study the problem of partitioning the node set of a directed acyclic graph into layers — the first step of the commonly accepted Sugiyama algorithm for drawing directed acyclic graphs as hierarchies. We present a combinatorial optimization approach to the layering problem; we define a graph layering polytope and describe its properties in terms of facet-defining inequalities. The theoretical study presented is the basis of a new branch-and-cut layering algorithm which produces better quality drawings of hierarchical graphs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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.
C. E. Ferreira, A. Martin, C. C. De Souza, R. Weismantel, and L. A. Wolsey. Formulations and valid inequalities for the node capacitated graph partitioning problem. Mathematical Programming, 74:247–266, 1996.
E. R. Gansner, E. Koutsofios, S. C. North, and K.-P Vo. A technique for drawing directed graphs. IEEE Transactions on Software Engineering, 19(3):214–230, March 1993.
M. Grötschel and M. W. Padberg. Polyhedral theory. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, editors, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Series in Discrete Mathematics, pages 251–305. John Wiley & Sons, 1985.
P. Healy and A. Kuusik. The vertex-exchange graph: A new concept for multilevel crossing minimization. In J. Kratochvíl, editor, Graph Drawing: Proceedings of 7th International Symposium, GD’ 99, volume 1731 of Lecture Notes in Computer Science, pages 205–216. Springer-Verlag, 1999.
P. Healy and N. S. Nikolov. How to layer a directed acyclic graph. In P. Mutzel, M. Jünger, and S. Leipert, editors, Graph Drawing: Proceedings of 9th International Symposium, GD 2001, volume 2265 of Lecture Notes in Computer Science, pages 16–30. Springer-Verlag, 2002.
M. Jünger, E. K. Lee, P. Mutzel, and T. Odenthal. A polyhedral approach to the multi-layer crossing minimization problem. In G. Di Battista, editor, Graph Drawing: 5th International Symposium, GD’ 97, volume 1353 of Lecture Notes in Computer Science, pages 13–24, Rome, Italy, September 1997. Springer-Verlag.
A. Mehrotra and M. A. Trick. Cliques and clustering: A combinatorial approach. Operations Research Letters, 22(1):1–12, 1998.
G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. Wiley-Interscience series in discrete mathematics and optimization. John Wiley & Sons, Inc., 1988.
K. Sugiyama, S. Tagawa, and M. Toda. Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man, and Cybernetics, 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). Facets of the Directed Acyclic Graph Layering Polytope. In: Goos, G., Hartmanis, J., van Leeuwen, J., Kučera, L. (eds) Graph-Theoretic Concepts in Computer Science. WG 2002. Lecture Notes in Computer Science, vol 2573. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36379-3_22
Download citation
DOI: https://doi.org/10.1007/3-540-36379-3_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00331-1
Online ISBN: 978-3-540-36379-8
eBook Packages: Springer Book Archive