Abstract
A layered drawing of a tree T is a planar straight-line drawing of T, where the vertices of T are placed on some horizontal lines called layers. A minimum-layer drawing of T is a layered drawing of T on k layers, where k is the minimum number of layers required for any layered drawing of T. In this paper we give a linear-time algorithm for obtaining minimum-layer drawings of trees.
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.
Similar content being viewed by others
References
Alam, M.J.: Minimum-layer drawings of trees. M. Sc. Engg. thesis, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology (2010)
Alam, M.J., Samee, M.A.H., Rabbi, M.M., Rahman, M.S.: Minimum-layer upward drawings of trees. Journal of Graph Algorithms and Applications 14(2), 245–267 (2010)
Cornelsen, S., Schank, T., Wagner, D.: Drawing graphs on two and three lines. Journal of Graph Algorithms and Applications 8(2), 161–177 (2004)
Dujmović, V., Fellows, M.R., Hallett, M.T., Kitching, M., Liotta, G., McCartin, C., Nishimura, N., Ragde, P., Rosamond, F.A., Suderman, M., Whitesides, S., Wood, D.R.: On the parameterized complexity of layered graph drawing. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 488–499. Springer, Heidelberg (2001)
Felsner, S., Liotta, G., Wismath, S.K.: Straight-line drawings on restricted integer grids in two and three dimensions. Journal of Graph Algorithms and Applications 7(4), 363–398 (2003)
Hayashi, K., Masuda, S.: Complexity results on the minimum width drawing problem for rooted unordered trees. Electronics and Communications in Japan (Part III: Fundamental Electronic Science) 81(1), 32–41 (1998)
Marriott, K., Stuckey, P.J.: NP-completeness of minimal width unordered tree layout. Journal of Graph Algorithms and Applications 8(2), 295–312 (2004)
Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific, Singapore (2004)
Suderman, M.: Pathwidth and layered drawings of trees. International Journal of Computational Geometry and Applications 14(3), 203–225 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mondal, D., Alam, M.J., Rahman, M.S. (2011). Minimum-Layer Drawings of Trees. In: Katoh, N., Kumar, A. (eds) WALCOM: Algorithms and Computation. WALCOM 2011. Lecture Notes in Computer Science, vol 6552. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19094-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-19094-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19093-3
Online ISBN: 978-3-642-19094-0
eBook Packages: Computer ScienceComputer Science (R0)