Computing Optimal Linear Layouts of Trees in Linear Time


We present a linear time algorithm which, given a tree, computes a linear layout optimal with respect to vertex separation. As a consequence optimal edge search strategies, optimal node search strategies, and optimal interval augmentations can be computed also in O(n) for trees. This improves the running time of former algorithms from O(n log n) to O(n) and… (More)
DOI: 10.1007/3-540-45253-2_37


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics