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 answers two related open questions raised in [7] and [15]. 1

DOI: 10.1007/3-540-45253-2_37

Extracted Key Phrases

Cite this paper

@inproceedings{Skodinis2000ComputingOL, title={Computing Optimal Linear Layouts of Trees in Linear Time}, author={Konstantin Skodinis}, booktitle={ESA}, year={2000} }