Abstract
We propose a new graph layering heuristic which can be used for hierarchical graph drawing with the minimum width. Our heuristic takes into account the space occupied by both the nodes and the edges of a directed acyclic graph and constructs layerings which are narrower that layerings constructed by the known layering algorithms. It can be used as a part of the Sugiyama method for hierarchical graph drawing. We present an extensive parameter study which we performed for designing our heuristic as well as for comparing it to other layering algorithms.
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
Branke, J., Eades, P., Leppert, S., Middendorf, M.: Width restricted layering of acyclic digraphs with consideration of dummy nodes. Technical Report No. 403, Intitute AIFB, University of Karlsruhe, 76128 Karlsruhe, Germany (2001)
Branke, J., Leppert, S., Middendorf, M., Eades, P.: Width-restriced layering of acyclic digraphs with consideration of dummy nodes. Information Processing Letters 81(2), 59–63 (2002)
Carpano, M.J.: Automatic display of hierarchized graphs for computer aided decision analysis. IEEE Transactions on Systems, Man and Cybernetics 10(11), 705–715 (1980)
Coffman, E.G., Graham, R.L.: Optimal scheduling for two processor systems. Acta Informatica 1, 200–213 (1972)
Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Tassinari, E., Vargiu, F.: An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications 7, 303–316 (1997)
Eades, P., Lin, X., Smyth, W.F.: A fast and effective heuristic for the feedback arc set problem. Information Processing Letters 47, 319–323 (1993)
Gansner, E.R., Koutsofios, E., North, S.C., Vo, K.-P.: A technique for drawing directed graphs. IEEE Transactions on Software Engineering 19(3), 214–230 (1993)
Healy, P., Nikolov, N.S.: A branch-and-cut approach to the directed acyclic graph layering problem. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 98–109. Springer, Heidelberg (2002)
Nikolov, N.S., Tarassov, A.: Graph layering by promotion of nodes. Special issue of Discrete Applied Mathematics associated with the IV ALIO/EURO Workshop on Applied Combinatorial Optimization (to appear)
Purchase, H.C., Cohen, R.F., James, M.: Validating graph drawing aesthetics. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 435–446. Springer, Heidelberg (1996)
Sugiyama, K., Misue, K.: Graph drawing by the magneting spring model. Journal of Visual Languages and Computing 6(3), 217–231 (1995)
Sugiyama, K., Tagawa, S., Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Transaction on Systems, Man, and Cybernetics 11(2), 109–125 (1981)
Utech, J., Branke, J., Schmeck, H., Eades, P.: An evolutionary algorithm for drawing directed graphs. In: Proceedings of the 1998 International Conference on Imaging Science, Systems, and Technology (CISST 1998), pp. 154–160 (1998)
Warfield, J.N.: Crossing theory and hierarchy mapping. IEEE Transactions on Systems, Man and Cybernetics 7(7), 502–523 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tarassov, A., Nikolov, N.S., Branke, J. (2004). A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes. In: Ribeiro, C.C., Martins, S.L. (eds) Experimental and Efficient Algorithms. WEA 2004. Lecture Notes in Computer Science, vol 3059. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24838-5_42
Download citation
DOI: https://doi.org/10.1007/978-3-540-24838-5_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22067-1
Online ISBN: 978-3-540-24838-5
eBook Packages: Springer Book Archive