Search

Various algorithms have been proposed for the problem of drawing rooted ordered trees. As one of them, Unno and colleagues [1] presented an O(n3) time algorithm that (1) produces an initial drawing of a given tree T, and then (2) finds a narrower drawing by repeatedly moving subtrees (n is the number of nodes in T). In this paper, we show that the same drawing can be obtained more efficiently by maintaining the contours of subtrees. If a natural restriction is imposed on the sizes of nodes, our method can be executed in a time O(n·α(n, n)), where α is a functional inverse of Ackermann's function. © 1997 Scripta Technica, Inc. Electron Comm Jpn Pt 3, 80(5): 31–41, 1997 [ABSTRACT FROM AUTHOR]