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. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Mondal, D., Alam, M. J., & Rahman, M. S. (2011). Minimum-layer drawings of trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6552 LNCS, pp. 221–232). https://doi.org/10.1007/978-3-642-19094-0_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
