Computing Optimal Linear Layouts of Trees in Linear Time (1999)
Cached
Download Links
- [infosun.fmi.uni-passau.de]
- [www.fmi.uni-passau.de]
- DBLP
Other Repositories/Bibliography
by
Konstantin Skodinis
| Venue: | Proc. ESA 2000, number 1879 |
| Citations: | 13 - 0 self |
BibTeX
@INPROCEEDINGS{Skodinis99computingoptimal,
author = {Konstantin Skodinis},
title = {Computing Optimal Linear Layouts of Trees in Linear Time},
booktitle = {Proc. ESA 2000, number 1879},
year = {1999},
pages = {403--414},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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].
