Computing Optimal Linear Layouts of Trees in Linear Time

Authors:
Konstantin Skodinis
Affiliations:
-
Venue:
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Year:
2000

Citing 15
Cited 3

Polynomial time algorithms for the min cut problem on degree restricted trees

SIAM Journal on Computing
A polynomial algorithm for the min-cut linear arrangement of trees

Journal of the ACM (JACM)
Searching and pebbling

Theoretical Computer Science
The complexity of searching a graph

Journal of the ACM (JACM)
Min cut is NP-complete for edge weighted trees

Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
On minimizing width in linear layouts

Discrete Applied Mathematics
The vertex separation number of a graph equals its path-width

Information Processing Letters
Recontamination does not help to search a graph

Journal of the ACM (JACM)
The pathwidth and treewidth of cographs

SIAM Journal on Discrete Mathematics
On the pathwidth of chordal graphs

Discrete Applied Mathematics - ARIDAM IV and V
The vertex separation and search number of a graph

Information and Computation
Treewidth and Pathwidth of Permutation Graphs

SIAM Journal on Discrete Mathematics
Efficient and constructive algorithms for the pathwidth and treewidth of graphs

Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth

SIAM Journal on Computing
Storage requirements for deterministic polynomialtime recognizable languages

Journal of Computer and System Sciences

Approximation of Pathwidth of Outerplanar Graphs

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Algorithms and complexity results for graph-based pursuit evasion

Autonomous Robots
Distributed chasing of network intruders

SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity

Quantified Score

Hi-index	0.00

Visualization

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].